Efficient Amplifiers and Bounded Degree Optimization

@inproceedings{Piotr2001EfficientAA,
  title={Efficient Amplifiers and Bounded Degree Optimization},
  author={Berman Piotr and Karpinski Marek},
  year={2001}
}

Citations

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

Guest column: the elusive inapproximability of the TSP

  • SIGACT News
  • 2014
VIEW 16 EXCERPTS
HIGHLY INFLUENCED

Proceedings 13 Volume Editors

VIEW 11 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Complexity of approximating bounded variants of optimization problems

  • Theor. Comput. Sci.
  • 2006
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

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

Tensor Rank is Hard to Approximate

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

On line graphs of subcubic triangle-free graphs

  • Discrete Mathematics
  • 2017
VIEW 2 EXCERPTS
CITES BACKGROUND