Approximation Algorithms for Covering/Packing Integer Programs

[1]  RaghavanPrabhakar.  Probabilistic construction of deterministic algorithms: approximating packing integer programs , 1988 .

[2]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[3]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[4]  Prabhakar Raghavan,et al.  Provably good routing in graphs: regular arrays , 1985, STOC '85.

[5]  Paul Erdös,et al.  Dual integer linear programs and the relationship between their optima , 1985, STOC '85.

[6]  J. Spencer.  Six standard deviations suffice , 1985 .

[7]  Man-Tak Shing,et al.  A decomposition algorithm for circuit routing , 1985 .

[8]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[9]  Richard M. Karp,et al.  Global wire routing in two-dimensional arrays , 1987, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10]  L. Wolsey,et al.  On the greedy heuristic for continuous covering and packing problems , 1982 .

[11]  P.P.G. Kramer,et al.  Wire routing in NP-complete , 1982 .

[12]  József Beck,et al.  "Integer-making" theorems , 1981, Discret. Appl. Math..

[13]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[14]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[15]  Joel H. Spencer,et al.  Balancing Families of Sets , 1978, J. Comb. Theory, Ser. A.

[16]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[17]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[18]  Egon Balas,et al.  Facets of the knapsack polytope , 1975, Math. Program..

[19]  Peter L. Hammer,et al.  Facet of regular 0–1 polytopes , 1975, Math. Program..

[20]  Alon Itai,et al.  On the complexity of time table and multi-commodity flow problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[21]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[22]  Laurence A. Wolsey,et al.  Faces for a linear inequality in 0–1 variables , 1975, Math. Program..

[23]  P. Herrmann.  ON REDUCIBILITY AMONG COMBINATORIAL PROBLEMS , 1973 .

[24]  Paul Erdös,et al.  On a Combinatorial Game , 1973, J. Comb. Theory, Ser. A.

[25]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[26]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[27]  E. Heinze.  Theorems , 1967 .

[28]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[29]  G. Dobson,et al.  Greedy Heuristics for Integer Programming with Non-negative Data , 2022 .