On dependent randomized rounding algorithms

This publication has 18 references indexed in Scilit:

• Randomized Algorithms
  Published by Cambridge University Press (CUP) ,1995
• The Minimum Satisfiability Problem
  SIAM Journal on Discrete Mathematics, 1994
• Shortest paths, single origin‐destination network design, and associated polyhedra
  Networks, 1993
• Minimal cut cover of a graph with an application to the testing of electronic boards
  Operations Research Letters, 1992
• Unimodular functions
  Discrete Applied Mathematics, 1986
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
  SIAM Journal on Computing, 1982
• Bin packing can be solved within 1 + ε in linear time
  Combinatorica, 1981
• A Greedy Heuristic for the Set-Covering Problem
  Mathematics of Operations Research, 1979
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
  Management Science, 1977
• On the notion of balance of a signed graph.
  The Michigan Mathematical Journal, 1953