Author of the publication

1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two.

, , and . Electron. Colloquium Comput. Complex., (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Competitive 3-Server Algorithm., , and . SODA, page 280-290. SIAM, (1990)A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two, , and . CoRR, (2008)On Systemic Stability of Banking Networks, , , and . CoRR, (2011)Investigations of Fault-Tolerant Networks of Computers (Preliminary Version), and . STOC, page 66-77. ACM, (1988)Improvements in throughout maximization for real-time scheduling., and . STOC, page 680-687. ACM, (2000)Controlling Size When Aligning Multiple Genomic Sequences with Duplications., , , and . WABI, volume 4175 of Lecture Notes in Computer Science, page 138-149. Springer, (2006)On-line Searching and Navigation.. Online Algorithms, volume 1442 of Lecture Notes in Computer Science, page 232-241. Springer, (1996)Weighted Voting for Operation Dependent Management of Replicated Data., and . WDAG, volume 486 of Lecture Notes in Computer Science, page 263-276. Springer, (1990)Approximating Transitive Reductions for Directed Networks., , and . WADS, volume 5664 of Lecture Notes in Computer Science, page 74-85. Springer, (2009)On the Approximation Properties of Independent Set Problem in Degree 3 Graphs., and . WADS, volume 955 of Lecture Notes in Computer Science, page 449-460. Springer, (1995)