Integer and combinatorial optimization
Integer and combinatorial optimization
Linear approximation of shortest superstrings
Journal of the ACM (JACM)
Randomized algorithms
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
A commercial application of survivable network design: ITP/INPLANS CCS network topology analyzer
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
ALGORITHMS FOR APPROXIMATE GRAPH COLORING
ALGORITHMS FOR APPROXIMATE GRAPH COLORING
Towards a DNA sequencing theory (learning a string)
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Approximability of partitioning graphs with supply and demand
Journal of Discrete Algorithms
| Hi-index | 0.00 |