메뉴 건너뛰기




Volumn , Issue , 2006, Pages 970-979

Oblivious network design

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; FUNCTIONS; ROUTERS;

EID: 33244479432     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109665     Document Type: Conference Paper
Times cited : (95)

References (39)
  • 2
    • 17744390925 scopus 로고    scopus 로고
    • Hardness of buy-at-bulk network design
    • M. ANDREWS, Hardness of buy-at-bulk network design, in Proc. of the 45th FOCS, 2004, pp. 115-124.
    • (2004) Proc. of the 45th FOCS , pp. 115-124
    • Andrews, M.1
  • 3
    • 1242332544 scopus 로고    scopus 로고
    • Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs
    • D. APPLEGATE AND E. COHEN, Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs, in Proc. of the SIGCOMM, 2003, pp. 313-324.
    • (2003) Proc. of the SIGCOMM , pp. 313-324
    • Applegate, D.1    Cohen, E.2
  • 6
    • 0030393774 scopus 로고    scopus 로고
    • Probabilistic approximations of metric spaces and its algorithmic applications
    • Y. BARTAL, Probabilistic approximations of metric spaces and its algorithmic applications, in Proc. of the 37th FOCS, 1996, pp. 184-193.
    • (1996) Proc. of the 37th FOCS , pp. 184-193
    • Bartal, Y.1
  • 7
    • 0031623888 scopus 로고    scopus 로고
    • On approximating arbitrary metrics by tree metrics
    • _, On approximating arbitrary metrics by tree metrics, in Proc. of the 30th STOC, 1998, pp. 161-168.
    • (1998) Proc. of the 30th STOC , pp. 161-168
  • 8
    • 0038560837 scopus 로고    scopus 로고
    • On-line routing in all-optical networks
    • Y. BARTAL AND S. LEONARDI, On-line routing in all-optical networks, Theor. Comput. Sci., 221 (1999), pp. 19-39.
    • (1999) Theor. Comput. Sci. , vol.221 , pp. 19-39
    • Bartal, Y.1    Leonardi, S.2
  • 9
    • 33244476177 scopus 로고    scopus 로고
    • Also in Proc. 24th ICALP, 1997, pp. 516-526.
    • (1997) Proc. 24th ICALP , pp. 516-526
  • 10
    • 0038717614 scopus 로고    scopus 로고
    • A practical algorithm for constructing oblivious routing schemes
    • M. BIENKOWSKI, M. KORZENIOWSKI, AND H. RÄCKE, A practical algorithm for constructing oblivious routing schemes, in Proc. of the 15th SPAA, 2003, pp. 24-33.
    • (2003) Proc. of the 15th SPAA , pp. 24-33
    • Bienkowski, M.1    Korzeniowski, M.2    Räcke, H.3
  • 12
    • 34848840958 scopus 로고    scopus 로고
    • On non-uniform multicommodity buy-at-bulk network design
    • M. CHARIKAR AND A. KARAGIOZOVA, On non-uniform multicommodity buy-at-bulk network design, in Proc. of the 37th STOC, 2005, pp. 176-182.
    • (2005) Proc. of the 37th STOC , pp. 176-182
    • Charikar, M.1    Karagiozova, A.2
  • 15
    • 17744371900 scopus 로고    scopus 로고
    • Approximating the stochastic knapsack problem: The benefit of adaptivity
    • B. C. DEAN, M. X. GOEMANS, AND J. VONDRÁK, Approximating the stochastic knapsack problem: The benefit of adaptivity, in Proc. of the 45th FOCS, 2004, pp. 208-217.
    • (2004) Proc. of the 45th FOCS , pp. 208-217
    • Dean, B.C.1    Goemans, M.X.2    Vondrák, J.3
  • 16
    • 0038784603 scopus 로고    scopus 로고
    • A tight bound on approximating arbitrary metrics by tree metrics
    • J. FAKCHAROENPHOL, S. B. RAO, AND K. TALWAR, A tight bound on approximating arbitrary metrics by tree metrics, in Proc. of the 35th STOC, 2003, pp. 448-455.
    • (2003) Proc. of the 35th STOC , pp. 448-455
    • Fakcharoenphol, J.1    Rao, S.B.2    Talwar, K.3
  • 17
    • 84947248249 scopus 로고    scopus 로고
    • On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design formulation
    • N. GARG, R. KHANDEKAR, G. KONJEVOD, R. RAVI, F. S. SALMAN, AND A. SINHA, On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design formulation, in Proc. of the 8th IPCO, 2001, pp. 170-184.
    • (2001) Proc. of the 8th IPCO , pp. 170-184
    • Garg, N.1    Khandekar, R.2    Konjevod, G.3    Ravi, R.4    Salman, F.S.5    Sinha, A.6
  • 18
    • 0037739959 scopus 로고    scopus 로고
    • Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk
    • A. GOEL AND D. ESTRIN, Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk, in Proc. of the 14th SODA, 2003, pp. 499-505.
    • (2003) Proc. of the 14th SODA , pp. 499-505
    • Goel, A.1    Estrin, D.2
  • 19
    • 0034505840 scopus 로고    scopus 로고
    • Hierarchical placement and network design problems
    • S. GUHA, A. MEYERSON, AND K. MUNAGALA, Hierarchical placement and network design problems, in Proc. of the 41st FOCS, 2000, pp. 603-612.
    • (2000) Proc. of the 41st FOCS , pp. 603-612
    • Guha, S.1    Meyerson, A.2    Munagala, K.3
  • 20
    • 0034832008 scopus 로고    scopus 로고
    • A constant factor approximation for the single sink edge installation problem
    • S. GUHA, A. MEYERSON, AND K. MUNGALA, A constant factor approximation for the single sink edge installation problem, in Proc. of the 33rd STOC, 2001, pp. 383-388.
    • (2001) Proc. of the 33rd STOC , pp. 383-388
    • Guha, S.1    Meyerson, A.2    Mungala, K.3
  • 21
    • 0344550482 scopus 로고    scopus 로고
    • Bounded geometries, fractals, and low-distortion embeddings
    • A. GUPTA, R. KRAUTHGAMER, AND J. R. LEE, Bounded geometries, fractals, and low-distortion embeddings, in Proc. of the 44th FOCS, 2003, pp. 534-543.
    • (2003) Proc. of the 44th FOCS , pp. 534-543
    • Gupta, A.1    Krauthgamer, R.2    Lee, J.R.3
  • 22
    • 20744432095 scopus 로고    scopus 로고
    • Approximations via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem
    • A. GUPTA, A. KUMAR, M. PÁL, AND T. ROUGHGARDEN, Approximations via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem, in Proc. of the 44th FOCS, 2003, pp. 606-615.
    • (2003) Proc. of the 44th FOCS , pp. 606-615
    • Gupta, A.1    Kumar, A.2    Pál, M.3    Roughgarden, T.4
  • 23
    • 0038107641 scopus 로고    scopus 로고
    • Simpler and better approximation algorithms for network design
    • A. GUPTA, A. KUMAR, AND T. ROUGHGARDEN, Simpler and better approximation algorithms for network design, in Proc. of the 35th STOC, 2003, pp. 365-372.
    • (2003) Proc. of the 35th STOC , pp. 365-372
    • Gupta, A.1    Kumar, A.2    Roughgarden, T.3
  • 24
    • 4544311041 scopus 로고    scopus 로고
    • Boosted sampling: Approximation algorithms for stochastic optimization problems
    • A. GUPTA, M. PÁL, R. RAVI, AND A. SINHA, Boosted sampling: Approximation algorithms for stochastic optimization problems, in Proc. of the 36th STOC, 2004, pp. 417-426.
    • (2004) Proc. of the 36th STOC , pp. 417-426
    • Gupta, A.1    Pál, M.2    Ravi, R.3    Sinha, A.4
  • 26
    • 0038717611 scopus 로고    scopus 로고
    • A polynomial-time tree decomposition to minimize congestion
    • C. HARRELSON, K. HILDRUM, AND S. B. RAO, A polynomial-time tree decomposition to minimize congestion, in Proc. of the 15th SPAA, 2003, pp. 34-43.
    • (2003) Proc. of the 15th SPAA , pp. 34-43
    • Harrelson, C.1    Hildrum, K.2    Rao, S.B.3
  • 27
  • 28
    • 1842539379 scopus 로고    scopus 로고
    • On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems
    • N. IMMORLICA, D. KARGER, M. MINKOFF, AND V. MIRROKNI, On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems, in Proc. of the 15th SODA, 2004, pp. 684-693.
    • (2004) Proc. of the 15th SODA , pp. 684-693
    • Immorlica, N.1    Karger, D.2    Minkoff, M.3    Mirrokni, V.4
  • 30
    • 0034497391 scopus 로고    scopus 로고
    • Building Steiner trees with incomplete global knowledge
    • D. R. KARGER AND M. MINKOFF, Building Steiner trees with incomplete global knowledge, in Proc. of the 41 st FOCS, 2000, pp. 613-623.
    • (2000) Proc. of the 41 St FOCS , pp. 613-623
    • Karger, D.R.1    Minkoff, M.2
  • 31
    • 0036957071 scopus 로고    scopus 로고
    • A constant-factor approximation algorithm for the multicommodity rent-or-buy problem
    • A. KUMAR, A. GUPTA, AND T. ROUGHGARDEN, A constant-factor approximation algorithm for the multicommodity rent-or-buy problem, in Proc. of the 43rd FOCS, 2002, pp. 333-342.
    • (2002) Proc. of the 43rd FOCS , pp. 333-342
    • Kumar, A.1    Gupta, A.2    Roughgarden, T.3
  • 35
    • 0036948872 scopus 로고    scopus 로고
    • Minimizing congestion in general networks
    • H. RÄCKE, Minimizing congestion in general networks, in Proc. of the 43rd FOCS, 2002, pp. 43-52.
    • (2002) Proc. of the 43rd FOCS , pp. 43-52
    • Räcke, H.1
  • 36
    • 0038183237 scopus 로고    scopus 로고
    • How bad is selfish routing?
    • T. ROUGHGARDEN AND E. TARDOS, How bad is selfish routing?, J. ACM, 49 (2002), pp. 236-259.
    • (2002) J. ACM , vol.49 , pp. 236-259
    • Roughgarden, T.1    Tardos, E.2
  • 37
    • 18044400590 scopus 로고    scopus 로고
    • Approximating the single-sink link-installation problem in network design
    • F. S. SALMAN, J. CHERIYAN, R. RAVI, AND S. SUBRAMANIAN, Approximating the single-sink link-installation problem in network design, SIAM J. Optimization, 11 (2000), pp. 595-610.
    • (2000) SIAM J. Optimization , vol.11 , pp. 595-610
    • Salman, F.S.1    Cheriyan, J.2    Ravi, R.3    Subramanian, S.4
  • 38
    • 84868668990 scopus 로고    scopus 로고
    • Single-sink buy-at-bulk LP has constant integrality gap
    • K. TALWAR, Single-sink buy-at-bulk LP has constant integrality gap, in Proc. of the 9th IPCO, 2002, pp. 475-486.
    • (2002) Proc. of the 9th IPCO , pp. 475-486
    • Talwar, K.1
  • 39
    • 85025263656 scopus 로고
    • Universal schemes for parallel communication
    • L. G. VALIANT AND G. J. BREBNER, Universal schemes for parallel communication, in Proc. of the 13th STOC, 1981, pp. 263-277.
    • (1981) Proc. of the 13th STOC , pp. 263-277
    • Valiant, L.G.1    Brebner, G.J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.