Author:
Berman Piotr,Hannenhalli Sridhar,Karpinski Marek
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. N. Amato, M. Blum, S. Irani and R. Rubinfeld, Reversing Trains: a turn of the century sorting problem, J. of Algorithms 10:413–428, 1989.
2. V. Bafna and P. Pevzner, Genome rearrangements and sorting by reversals, Proc. of 34th IEEE FOCS, 148–157, 1993; also in SIAM J. on Computing 25:272–289, 1996.
3. P. Berman and M. Fürer, Approximating independent set problem in bounded degree graphs, Proc. SODA 1994, 365–371.
4. P. Berman and S. Hannenhalli, Fast Sorting by Reversals, Proc. of 7th CPM, 168–185, 1996.
5. P. Berman and M. Karpinski, On some tighter inapproximability results, Proc. of 26th ICALP, LNCS 1644:200–209, Springer-Verlag, Berlin, 1999.
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献