Skip to main content
SpringerLink
Log in

On dependent randomized rounding algorithms

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1084))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley, New York, 1992.

    Google Scholar 

  2. M. Bazaraa, J. Jarvis and H. Sherali. Linear Programming and Network Flows, 2nd ed. Wiley, New York, 1990.

    Google Scholar 

  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.

    Google Scholar 

  4. D. Bertsimas and R. Vohra. Linear programming relaxations, approximation algorithms and randomization: a unified view of covering problems, Preprint 1994.

    Google Scholar 

  5. H. Brönnimann and M. Goodrich. Almost optimal set covers in finite VC-dimension, Proc 10th Annual Symp. Computational Geometry, 293–301, 1994.

    Google Scholar 

  6. S. Chopra, I. Gilboa and T. Sastry. Source sink flows with capacity installation in batches, preprint, 1995.

    Google Scholar 

  7. G. Cornuejols, M. Fisher and G. Nemhauser. Location of Bank Accounts to optimize float: An analytic study of exact and approximate algorithms, Management Science, 23, 789–810, 1977.

    Google Scholar 

  8. V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4, 233–235, 1979.

    Google Scholar 

  9. W. Fernandez de la Vega and G. Lueker. Bin packing solved within 1+ε in linear time, Combinatorica, 1, 349–355, 1981.

    Google Scholar 

  10. M.X. Goemans and D. Williamson. A new 3/4 approximation algorithm for MAX SAT, Proc. 3rd IPCO Conference, 313–321, 1993.

    Google Scholar 

  11. M.X. Goemans and D. Williamson. 878 approximation algorithms for MAX-CUT and MAX 2SAT, Proc. 26th Annual ACM STOC, 422–431, 1994.

    Google Scholar 

  12. M. Grötschel and L. Lovász. Combinatorial Optimization: A survey, DIMACS Technical Report 93–29, 1993.

    Google Scholar 

  13. P. Hansen and B. Simeone. Unimodular functions, Discrete Applied Mathematics, 14, 269–281, 1986.

    Article  Google Scholar 

  14. F. Harary. On the notion of balance of a signed graph, Michig. Math. Journal, 2, 143–146, 1953.

    Article  Google Scholar 

  15. D. Hochbaum. Approximation algorithms for Set Covering and Vertex Cover Problems, SIAM Journal on Computing, 11, 555–556, 1982.

    Article  Google Scholar 

  16. R. Kohli, R. Khrishnamurti and P. Mirchandani. The minimum satisfiability problem, SIAM Journal of Discrete Mathematics, 7(2), 275–283, 1994.

    Article  Google Scholar 

  17. R. Loulou. Minimal cut cover of a graph with an application to the testing of electronic boards, Operations Research Letters, 12, 301–305, 1992.

    Article  Google Scholar 

  18. T. Magnanti and P. Mirchandani. Shortest paths, single origin-destination network design, and associated polyhedra, Networks, 23, 103–121, 1993.

    Google Scholar 

  19. M. Marathe and S. Ravi. On approximation algorithms for the minimum satisfiability problems, Preprint, 1995.

    Google Scholar 

  20. R. Motwani and J. Naor. On exact and approximate cut covers of graphs, Preprint, 1993.

    Google Scholar 

  21. R. Motwani and P. Raghavan. Randomized Algorithms, Cambridge University Press, 1995.

    Google Scholar 

  22. G. Nemhauser and L. Wolsey. Integer and Combinatorial Optimization, Wiley, New York, 1988.

    Google Scholar 

  23. P. Raghavan and C. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorica, 7, 365–374, 1987.

    Google Scholar 

  24. D. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem, Math Programming, 62, 461–474, 1993.

    Article  Google Scholar 

  25. A. Srinivasan. Improved Approximations of Packing and Covering Problems, Proceedings of the 28th Annual Symposium on Theory of Computing, 268–276, 1995.

    Google Scholar 

  26. M. Yannakakis. On the approximation of maximum satisfiability, Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, 1–9, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sloan School of Management and Operations Research Center, MIT, USA

    Dimitris Bertsimas

  2. Operations Research Center, MIT, USA

    Chung-Piaw Teo

  3. Fisher College of Business, Ohio State University, USA

    Rakesh Vohra

Authors
  1. Dimitris Bertsimas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chung-Piaw Teo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rakesh Vohra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

William H. Cunningham S. Thomas McCormick Maurice Queyranne

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertsimas, D., Teo, CP., Vohra, R. (1996). On dependent randomized rounding algorithms. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds) Integer Programming and Combinatorial Optimization. IPCO 1996. Lecture Notes in Computer Science, vol 1084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61310-2_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-61310-2_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61310-7

  • Online ISBN: 978-3-540-68453-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation