Author:
Bertsimas Dimitris,Teo Chung-Piaw,Vohra Rakesh
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley, New York, 1992.
2. M. Bazaraa, J. Jarvis and H. Sherali. Linear Programming and Network Flows, 2nd ed. Wiley, New York, 1990.
3. D. Bertsimas, C. Teo and R. Vohra. Nonlinear relaxations and improved randomized approximation algorithms for multicut problems, Proc. 4th IPCO Conference, 29–39, 1995.
4. D. Bertsimas and R. Vohra. Linear programming relaxations, approximation algorithms and randomization: a unified view of covering problems, Preprint 1994.
5. H. Brönnimann and M. Goodrich. Almost optimal set covers in finite VC-dimension, Proc 10th Annual Symp. Computational Geometry, 293–301, 1994.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dual parameterization and parameterized approximability of subset graph problems;RAIRO - Operations Research;2017-01
2. Approximation Preserving Reductions;Paradigms of Combinatorial Optimization;2014-08-08
3. General Bibliography;Paradigms of Combinatorial Optimization;2014-08-08
4. Optimal Satisfiability;Paradigms of Combinatorial Optimization;2014-08-08
5. Survey on Fingerprint Classification Methods for Biological Sequences;Biological Knowledge Discovery Handbook;2013-12-27