Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

@inproceedings{Goemans2001ApproximationRA,
  title={Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
  author={Michel X. Goemans and Klaus Jansen and Jos{\'e} D. P. Rolim and Luca Trevisan},
  booktitle={Lecture Notes in Computer Science},
  year={2001}
}
Invited Talks.- Using Complex Semidefinite Programming for Approximating MAX E2-LIN3.- Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems.- Web Search via Hub Synthesis.- Error-Correcting Codes and Pseudorandom Projections.- Order in Pseudorandomness.- Contributed Talks of APPROX.- Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows.- On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique.- Online Weighted Flow… CONTINUE READING

Citations

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

References

Publications referenced by this paper.
SHOWING 1-10 OF 55 REFERENCES

On Approximation Lower Bounds for TSP with Bounded Metrics

  • Electronic Colloquium on Computational Complexity
  • 2012
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

13/9-approximation for Graphic TSP

  • STACS
  • 2011
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Hardness of Minimizing and Learning DNF Expressions

  • 2008 49th Annual IEEE Symposium on Foundations of Computer Science
  • 2008
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

On approximation of the vertex cover problem in hypergraphs

  • Discrete Optimization
  • 2005
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Improved Approximation Lower Bounds on Small Occurrence Optimization

  • Electronic Colloquium on Computational Complexity
  • 2003
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Vertex cover might be hard to approximate to within 2-epsilon

  • J. Comput. Syst. Sci.
  • 2003
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL