An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
Information Processing Letters
The traveling salesman problem with distances one and two
Mathematics of Operations Research
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Formulations and hardness of multiple sorting by reversals
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
On the approximation hardness of dense TSP and other path problems
Information Processing Letters
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On bounded occurrence constraint satisfaction
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Approximation Hardness of TSP with Bounded Metrics
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Approximating-CVP to within Almost-Polynomial Factors is NP-Hard
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A polylogarithmic approximation of the minimum bisection
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
The hardness of approximate optima in lattices, codes, and systems of linear equations
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
An explicit lower bound for TSP with distances one and two
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Finding a maximum likelihood tree is hard
Journal of the ACM (JACM)
Explicit inapproximability bounds for the shortest superstring problem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On the approximability of Dodgson and Young elections
Artificial Intelligence
Improved inapproximability results for the shortest superstring and related problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
| Hi-index | 0.00 |
We present some of the recent results on computational complexity of approximating bounded degree combinatorial optimization problems. In particular, we present the best up to now known explicit nonapproximability bounds on the very small degree optimization problems which are of particular importance on the intermediate stages of proving approximation hardness of some other generic optimization problems.