-
1
-
-
0004393852
-
Optima of dual integer linear programs
-
R. AHARONI, P. ERDOS, AND N. LINIAL. Optima of dual integer linear programs, Combinatorica, 8 (1988), pp. 13-20.
-
(1988)
Combinatorica
, vol.8
, pp. 13-20
-
-
Aharoni, R.1
Erdos, P.2
Linial, N.3
-
2
-
-
0007511716
-
The harmonic mean formula for probabilities of unions: Applications to sparse random graphs
-
D. ALDOUS, The Harmonic Mean Formula for probabilities of unions: Applications to sparse random graphs, Discrete Math., 76 (1989), pp. 107-176.
-
(1989)
Discrete Math.
, vol.76
, pp. 107-176
-
-
Aldous, D.1
-
3
-
-
0003430191
-
-
Wiley-Interscience, New York
-
N. ALON, J. H. SPENCER, AND P. ERDOS, The Probabilistic Method, Wiley-Interscience, New York, 1992.
-
(1992)
The Probabilistic Method
-
-
Alon, N.1
Spencer, J.H.2
Erdos, P.3
-
4
-
-
0027308413
-
Efficient probabilistically checkable proofs and applications to approximation
-
San Diego, CA
-
M. BELLARE, S. GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistically checkable proofs and applications to approximation, in Proceedings if the ACM Symposium on Theory of Computing, San Diego, CA, 1993, pp. 294-304.
-
(1993)
Proceedings if the ACM Symposium on Theory of Computing
, pp. 294-304
-
-
Bellare, M.1
Goldwasser, S.2
Lund, C.3
Russell, A.4
-
5
-
-
0343752389
-
-
Technical Report OR 285-94, Massachusetts Institute of Technology, Cambridge, MA
-
D. BERTSIMAS AND R. VOHRA, Linear programming relaxations, approximation algorithms and randomization; A unified view of covering problems. Technical Report OR 285-94, Massachusetts Institute of Technology, Cambridge, MA, 1994.
-
(1994)
Linear Programming Relaxations, Approximation Algorithms and Randomization; A Unified View of Covering Problems
-
-
Bertsimas, D.1
Vohra, R.2
-
6
-
-
25044445636
-
Almost optimal set covers in finite VC-dimensions
-
H. BRÖNNIMANN AND M. T. GOODRICH, Almost optimal set covers in finite VC-dimensions, Discrete Comput. Geom., 14 (1995), pp. 463-479.
-
(1995)
Discrete Comput. Geom.
, vol.14
, pp. 463-479
-
-
Brönnimann, H.1
Goodrich, M.T.2
-
7
-
-
0000182415
-
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
-
H. CHERNOFF, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statist., 23 (1952), pp. 493-509.
-
(1952)
Ann. Math. Statist.
, vol.23
, pp. 493-509
-
-
Chernoff, H.1
-
8
-
-
0000301097
-
A greedy heuristic for the set covering problem
-
V. CHVÁTAL, A greedy heuristic for the set covering problem, Math. Oper. Res., 4 (1979), pp. 233-235.
-
(1979)
Math. Oper. Res.
, vol.4
, pp. 233-235
-
-
Chvátal, V.1
-
9
-
-
0004148969
-
-
Technical Report SI/RR-95/02, Department of Computer Science, University of Rome "La Sapienza,"
-
P. CRESCENZI AND V. KANN. A compendium of NP optimization problems, Technical Report SI/RR-95/02, Department of Computer Science, University of Rome "La Sapienza," 1995.
-
(1995)
A Compendium of NP Optimization Problems
-
-
Crescenzi, P.1
Kann, V.2
-
10
-
-
0000951232
-
Worst-case analysis of greedy heuristics for integer programming with nonnegative data
-
G. DOBSON, Worst-case analysis of greedy heuristics for integer programming with nonnegative data, Math. Oper. Res., 7 (1982), pp. 515-531.
-
(1982)
Math. Oper. Res.
, vol.7
, pp. 515-531
-
-
Dobson, G.1
-
11
-
-
84946648904
-
Coherent structures of non-identical components
-
J. D. ESARY AND F. PROSCHAN, Coherent structures of non-identical components, Technometrics, 5 (1963), pp. 191-209.
-
(1963)
Technometrics
, vol.5
, pp. 191-209
-
-
Esary, J.D.1
Proschan, F.2
-
13
-
-
0001313040
-
On the greedy heuristic for continuous covering and packing problems
-
M. L. FISHER AND L. A. WOLSEY, On the greedy heuristic for continuous covering and packing problems, SIAM J. Alg. Discrete Methods, 3 (1982), pp. 584-591.
-
(1982)
SIAM J. Alg. Discrete Methods
, vol.3
, pp. 584-591
-
-
Fisher, M.L.1
Wolsey, L.A.2
-
14
-
-
0002748055
-
Correlational inequalities on some partially ordered sets
-
C. M. FORTUIN, P. W. KASTELEYN, AND J. GINIBRE, Correlational inequalities on some partially ordered sets, Comm. Math. Phys., 22 (1971), pp. 89-103.
-
(1971)
Comm. Math. Phys.
, vol.22
, pp. 89-103
-
-
Fortuin, C.M.1
Kasteleyn, P.W.2
Ginibre, J.3
-
15
-
-
0041430118
-
Application of the FKG inequality and its relatives
-
A. Bachem, M. Grötschel, and B. Korte, eds., Springer-Verlag, Berlin, New York
-
R. L. GRAHAM, Application of the FKG inequality and its relatives, in Mathematical Programming: The State of the Art, A. Bachem, M. Grötschel, and B. Korte, eds., Springer-Verlag, Berlin, New York, 1983.
-
(1983)
Mathematical Programming: The State of the Art
-
-
Graham, R.L.1
-
18
-
-
34250227246
-
Heuristics for the fixed cost median problem
-
D. S. HOCHBAUM, Heuristics for the fixed cost median problem, Math. Programming, 22 (1982), pp. 148-162.
-
(1982)
Math. Programming
, vol.22
, pp. 148-162
-
-
Hochbaum, D.S.1
-
19
-
-
84947403595
-
Probability inequalities for sums of bounded random variables
-
W. HOEFFDING, Probability inequalities for sums of bounded random variables, Amer. Statist. Assoc. J., 58 (1963), pp. 13-30.
-
(1963)
Amer. Statist. Assoc. J.
, vol.58
, pp. 13-30
-
-
Hoeffding, W.1
-
20
-
-
0000850549
-
An upper bound for the probability of a union
-
D. HUNTER, An upper bound for the probability of a union, J. Appl. Probab., 13 (1976), pp. 597-603.
-
(1976)
J. Appl. Probab.
, vol.13
, pp. 597-603
-
-
Hunter, D.1
-
21
-
-
0016349356
-
Approximation algorithms for combinatorial problems
-
D. S. JOHNSON, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.
-
(1974)
J. Comput. System Sci.
, vol.9
, pp. 256-278
-
-
Johnson, D.S.1
-
22
-
-
0002879989
-
Covering problems
-
P. B. Mirchandani and R. L. Francis, eds., Wiley-Interscience, New York
-
A. KOLEN AND A. TAMIR, Covering problems, in Discrete Location Theory, P. B. Mirchandani and R. L. Francis, eds., Wiley-Interscience, New York, 1990. pp. 263-304.
-
(1990)
Discrete Location Theory
, pp. 263-304
-
-
Kolen, A.1
Tamir, A.2
-
23
-
-
0000203509
-
On the ratio of optimal integral and fractional covers
-
L. LOVÁSZ, On the ratio of optimal integral and fractional covers, Discrete Math., 13 (1975), pp. 383-390.
-
(1975)
Discrete Math.
, vol.13
, pp. 383-390
-
-
Lovász, L.1
-
24
-
-
0028514351
-
On the hardness of approximating minimization problems
-
C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. ACM, 41 (1994), pp. 960-981.
-
(1994)
J. ACM
, vol.41
, pp. 960-981
-
-
Lund, C.1
Yannakakis, M.2
-
26
-
-
0029246498
-
Optimal file sharing in distributed networks
-
M. NAOR AND R. M. ROTH, Optimal file sharing in distributed networks, SIAM J. Comput., 24 (1995), pp. 158-183.
-
(1995)
SIAM J. Comput.
, vol.24
, pp. 158-183
-
-
Naor, M.1
Roth, R.M.2
-
27
-
-
0000126694
-
Fast approximation algorithms for fractional packing and covering problems
-
S. A. PLOTKIN, D. B. SHMOYS, AND É. TARDOS, Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res., 20 (1995), pp. 257-301.
-
(1995)
Math. Oper. Res.
, vol.20
, pp. 257-301
-
-
Plotkin, S.A.1
Shmoys, D.B.2
Tardos, E.3
-
28
-
-
0000435276
-
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
-
P. RAGHAVAN, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci., 37 (1988), pp. 130-143.
-
(1988)
J. Comput. System Sci.
, vol.37
, pp. 130-143
-
-
Raghavan, P.1
-
29
-
-
85000363138
-
Randomized approximation algorithms in combinatorial optimization
-
Springer-Verlag, Berlin
-
P. RAGHAVAN, Randomized approximation algorithms in combinatorial optimization, in Proceedings of the FST and TCS Conference, 1994, Lecture Notes in Comput. Sci. 880, Springer-Verlag, Berlin, pp. 300-317.
-
Proceedings of the FST and TCS Conference, 1994, Lecture Notes in Comput. Sci.
, vol.880
, pp. 300-317
-
-
Raghavan, P.1
-
30
-
-
51249173817
-
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
-
P. RAGHAVAN AND C. D. THOMPSON, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica, 7 (1987), pp. 365-374.
-
(1987)
Combinatorica
, vol.7
, pp. 365-374
-
-
Raghavan, P.1
Thompson, C.D.2
-
31
-
-
0040905371
-
-
Technical Report 124, Department of Operations Research and Statistics, Stanford University, Stanford, CA
-
T. K. SARKAR, Some lower bounds of reliability, Technical Report 124, Department of Operations Research and Statistics, Stanford University, Stanford, CA, 1969.
-
(1969)
Some Lower Bounds of Reliability
-
-
Sarkar, T.K.1
-
33
-
-
0030645561
-
Approximation algorithms for facility location problems
-
El Paso, TX
-
D. B. SHMOYS, É. TARDOS, AND K. AARDAL, Approximation algorithms for facility location problems, in Proceedings of the ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 265-274.
-
(1997)
Proceedings of the ACM Symposium on Theory of Computing
, pp. 265-274
-
-
Shmoys, D.B.1
Tardos, E.2
Aardal, K.3
-
34
-
-
0000489883
-
A tight analysis of the greedy algorithm for set cover
-
P. SLAVÍK, A tight analysis of the greedy algorithm for set cover, J. Algorithms, 25 (1997), pp. 237-254.
-
(1997)
J. Algorithms
, vol.25
, pp. 237-254
-
-
Slavík, P.1
-
35
-
-
0242306026
-
Ten lectures on the probabilistic method
-
Philadelphia
-
J. SPENCER, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987.
-
(1987)
SIAM
-
-
Spencer, J.1
-
36
-
-
84862598391
-
Six standard deviations suffice
-
J. H. SPENCER, Six standard deviations suffice, Trans. Amer. Math. Soc., 289 (1985), pp. 679-706.
-
(1985)
Trans. Amer. Math. Soc.
, vol.289
, pp. 679-706
-
-
Spencer, J.H.1
-
37
-
-
85013574565
-
An extension of the Lovász local lemma, and its applications to integer programming
-
Atlanta, GA
-
A. SRINIVASAN, An extension of the Lovász local lemma, and its applications to integer programming, in Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, 1996, pp. 6-15.
-
(1996)
Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms
, pp. 6-15
-
-
Srinivasan, A.1
-
38
-
-
0031359907
-
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
-
Miami Beach, FL
-
A. SRINIVASAN, Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems, in Proceedings of the IEEE Symposium on Foundations of Computer Science, Miami Beach, FL, 1997, pp. 416-425.
-
(1997)
Proceedings of the IEEE Symposium on Foundations of Computer Science
, pp. 416-425
-
-
Srinivasan, A.1
-
39
-
-
0001263144
-
On an extremal problem in graph theory
-
P. TURÁN, On an extremal problem in graph theory, Mat. Fiz. Lapok, 48 (1941), pp. 436-452.
-
(1941)
Mat. Fiz. Lapok
, vol.48
, pp. 436-452
-
-
Turán, P.1
|