-
2
-
-
46449094617
-
New approaches for virtual private network design
-
Eisenbrand, F., Grandoni, F., Oriolo, G., Skutella, M.: New approaches for virtual private network design. SIAM J. Comput. 37(3), 706-721 (2007)
-
(2007)
SIAM J. Comput
, vol.37
, Issue.3
, pp. 706-721
-
-
Eisenbrand, F.1
Grandoni, F.2
Oriolo, G.3
Skutella, M.4
-
3
-
-
58449094051
-
-
Eisenbrand, F., Grandoni, F., Rothvoß, T., Schäfer, G.: Approximating connected facility location problems via random facility sampling and core detouring. In: SODA, pp. 1174-1183 (2008)
-
Eisenbrand, F., Grandoni, F., Rothvoß, T., Schäfer, G.: Approximating connected facility location problems via random facility sampling and core detouring. In: SODA, pp. 1174-1183 (2008)
-
-
-
-
5
-
-
4544291996
-
A tight bound on approximating arbitrary metrics by tree metrics
-
Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. System Sci. 69(3), 485-497 (2004)
-
(2004)
J. Comput. System Sci
, vol.69
, Issue.3
, pp. 485-497
-
-
Fakcharoenphol, J.1
Rao, S.2
Talwar, K.3
-
6
-
-
57949102377
-
-
SODA, pp
-
Garg, N., Gupta, A., Leonardi, S., Sankowski, P.: Stochastic analyses for online combinatorial optimization problems. In: SODA, pp. 942-951 (2008)
-
(2008)
Stochastic analyses for online combinatorial optimization problems
, pp. 942-951
-
-
Garg, N.1
Gupta, A.2
Leonardi, S.3
Sankowski, P.4
-
7
-
-
84947248249
-
-
Garg, N., Khandekar, R., Konjevod, G., Ravi, R., Salman, F.S., Sinha, A.: On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, 2081, pp. 170-184. Springer, Heidelberg (2001)
-
Garg, N., Khandekar, R., Konjevod, G., Ravi, R., Salman, F.S., Sinha, A.: On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 170-184. Springer, Heidelberg (2001)
-
-
-
-
8
-
-
0000875467
-
-
Goemans, M.X., Bertsimas, D.J.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Program. 60(2, Ser. A), 145-166 (1993)
-
Goemans, M.X., Bertsimas, D.J.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Program. 60(2, Ser. A), 145-166 (1993)
-
-
-
-
9
-
-
77249107908
-
-
Grandoni, F., Italiano, G.F.: Improved approximation for single-sink buy-at-bulk. In: Asano, T. (ed.) ISAAC 2006. LNCS, 4288, pp. 111-120. Springer, Heidelberg (2006)
-
Grandoni, F., Italiano, G.F.: Improved approximation for single-sink buy-at-bulk. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 111-120. Springer, Heidelberg (2006)
-
-
-
-
10
-
-
0345412651
-
Approximation via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem
-
Gupta, A., Kumar, A., Pal, M., Roughgarden, T.: Approximation via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem. In: FOCS, pp. 606-615 (2003)
-
(2003)
FOCS
, pp. 606-615
-
-
Gupta, A.1
Kumar, A.2
Pal, M.3
Roughgarden, T.4
-
11
-
-
34250331246
-
Approximation via cost sharing: Simpler and better approximation algorithms for network design
-
Gupta, A., Kumar, A., Pál, M., Roughgarden, T.: Approximation via cost sharing: simpler and better approximation algorithms for network design. J. ACM 54(3), 11 (2007)
-
(2007)
J. ACM
, vol.54
, Issue.3
, pp. 11
-
-
Gupta, A.1
Kumar, A.2
Pál, M.3
Roughgarden, T.4
-
12
-
-
0038107641
-
Simpler and better approximation algorithms for network design
-
Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: STOC, pp. 365-372 (2003)
-
(2003)
STOC
, pp. 365-372
-
-
Gupta, A.1
Kumar, A.2
Roughgarden, T.3
-
13
-
-
4544311041
-
Boosted sampling: Approximation algorithms for stochastic optimization
-
Gupta, A., Pal, M., Ravi, R., Sinha, A.: Boosted sampling: approximation algorithms for stochastic optimization. In: STOC, pp. 417-426 (2004)
-
(2004)
STOC
, pp. 417-426
-
-
Gupta, A.1
Pal, M.2
Ravi, R.3
Sinha, A.4
-
14
-
-
37249062207
-
Cost-sharing mechanisms for network design
-
Gupta, A., Srinivasan, A., Tardos, E.: Cost-sharing mechanisms for network design. Algorithmica 50(1), 98-119 (2008)
-
(2008)
Algorithmica
, vol.50
, Issue.1
, pp. 98-119
-
-
Gupta, A.1
Srinivasan, A.2
Tardos, E.3
-
15
-
-
45849105611
-
Approximation algorithms for connected facility location problems
-
to appear
-
Hasan, M.K., Jung, H., Chwa, K.-Y.: Approximation algorithms for connected facility location problems. J. Comb. Optim, (to appear, 2008)
-
(2008)
J. Comb. Optim
-
-
Hasan, M.K.1
Jung, H.2
Chwa, K.-Y.3
-
16
-
-
1842539379
-
-
Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.S.: On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. In: SODA, pp. 691-700 (2004)
-
Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.S.: On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. In: SODA, pp. 691-700 (2004)
-
-
-
-
17
-
-
0000435276
-
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
-
Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. System Sci. 37(2), 130-143 (1988)
-
(1988)
J. Comput. System Sci
, vol.37
, Issue.2
, pp. 130-143
-
-
Raghavan, P.1
-
18
-
-
57749180097
-
-
Shmoys, D., Talwar, K.: A constant approximation algorithm for the a priori traveling salesman problem. In: IPCO (2008)
-
Shmoys, D., Talwar, K.: A constant approximation algorithm for the a priori traveling salesman problem. In: IPCO (2008)
-
-
-
-
19
-
-
0025489266
-
Analyzing the Held-Karp TSP bound: A monotonicity property with application
-
Shmoys, D.B., Williamson, D.P.: Analyzing the Held-Karp TSP bound: A monotonicity property with application. Inf. Process. Lett. 35, 281-285 (1990)
-
(1990)
Inf. Process. Lett
, vol.35
, pp. 281-285
-
-
Shmoys, D.B.1
Williamson, D.P.2
-
20
-
-
84868668990
-
-
Talwar, K.: The single-sink buy-at-bulk LP has constant integrality gap. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, 2337, pp. 475-486. Springer, Heidelberg (2002)
-
Talwar, K.: The single-sink buy-at-bulk LP has constant integrality gap. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 475-486. Springer, Heidelberg (2002)
-
-
-
-
21
-
-
34748892528
-
A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
-
Williamson, D.P., van Zuylen, A.: A simpler and better derandomization of an approximation algorithm for single source rent-or-buy. Oper. Res. Lett. 35(6), 707-712 (2007)
-
(2007)
Oper. Res. Lett
, vol.35
, Issue.6
, pp. 707-712
-
-
Williamson, D.P.1
van Zuylen, A.2
-
22
-
-
0012612227
-
Heuristic analysis, linear programming and branch and bound
-
Wolsey, L.A.: Heuristic analysis, linear programming and branch and bound. Math. Prog. Study 13, 121-134 (1980)
-
(1980)
Math. Prog. Study
, vol.13
, pp. 121-134
-
-
Wolsey, L.A.1
|