Improved Approximation Lower Bounds on Small Occurrence Optimization

@article{Berman2003ImprovedAL,
  title={Improved Approximation Lower Bounds on Small Occurrence Optimization},
  author={Piotr Berman and Marek Karpinski},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2003},
  volume={10}
}

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 41 CITATIONS

Approximability of Combinatorial Optimization Problems on Power Law Networks

VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Guest column: the elusive inapproximability of the TSP

  • SIGACT News
  • 2014
VIEW 21 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Proceedings 13 Volume Editors

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Clique in 3-track interval graphs is APX-hard

  • ArXiv
  • 2012
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Inapproximability of Maximal Strip Recovery: II

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

  • Lecture Notes in Computer Science
  • 2001
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

On largest volume simplices and sub-determinants

VIEW 4 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Improved Inapproximability for TSP

  • APPROX-RANDOM
  • 2012
VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED