메뉴 건너뛰기




Volumn , Issue , 2003, Pages 373-382

Meet and merge: Approximation algorithms for confluent flows

Author keywords

Approximation algorithms; Confluent flow; Multicommodity flow; Network flow; Randomization; Rounding; Routing

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); DATA TRANSFER; INTERNET;

EID: 0042347686     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (12)

References (27)
  • 2
    • 25344450320 scopus 로고    scopus 로고
    • Branching processes
    • Department of Statistics, University of Georgia
    • K. Athreya and A. Vidyashankar. Branching processes. Technical Report TR-99-16, Department of Statistics, University of Georgia, 1999.
    • (1999) Technical Report , vol.TR-99-16
    • Athreya, K.1    Vidyashankar, A.2
  • 3
    • 0000927271 scopus 로고    scopus 로고
    • An O(log k) approximate min-cut max-flow theorem and approximation algorithm
    • Feb.
    • Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing, 27(1):291-301, Feb. 1998.
    • (1998) SIAM Journal on Computing , vol.27 , Issue.1 , pp. 291-301
    • Aumann, Y.1    Rabani, Y.2
  • 4
    • 0042599311 scopus 로고    scopus 로고
    • Meet and merge: Approximation algorithms for confluent flows
    • College of Computer & Information Science, Northeastern University, March
    • J. Chen, R. Rajaraman, and R. Sundaram. Meet and merge: Approximation algorithms for confluent flows. Technical report, College of Computer & Information Science, Northeastern University, March 2003.
    • (2003) Technical Report
    • Chen, J.1    Rajaraman, R.2    Sundaram, R.3
  • 13
    • 0043100185 scopus 로고
    • Bounded branching process and AND/OR tree evaluation
    • R. Karp and Y. Zhang. Bounded branching process and AND/OR tree evaluation. Random Structures & Algorithms, 7:97-116, 1995.
    • (1995) Random Structures & Algorithms , vol.7 , pp. 97-116
    • Karp, R.1    Zhang, Y.2
  • 17
    • 0036106499 scopus 로고    scopus 로고
    • An approximation algorithm for the covering steiner problem
    • Special Issue on Probabilistic Methods in Combinatorial Optimization
    • G. Konjevod, R. Ravi, and A. Srinivasan. An approximation algorithm for the covering steiner problem. Random Structures & Algorithms, 20:465-48, 2002. Special Issue on Probabilistic Methods in Combinatorial Optimization.
    • (2002) Random Structures & Algorithms , vol.20 , pp. 465-548
    • Konjevod, G.1    Ravi, R.2    Srinivasan, A.3
  • 19
    • 0000651166 scopus 로고    scopus 로고
    • Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
    • T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM: Journal of the ACM, 46, 1999.
    • (1999) JACM: Journal of the ACM , vol.46
    • Leighton, T.1    Rao, S.2
  • 20
    • 0000652415 scopus 로고
    • The geometry of graphs and some of its algorithmic applications
    • N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215-245, 1995.
    • (1995) Combinatorica , vol.15 , pp. 215-245
    • Linial, N.1    London, E.2    Rabinovich, Y.3
  • 23
    • 0001035413 scopus 로고
    • On the method of bounded differences
    • J. Siemons, editor. Cambridge University Press, Cambridge, UK
    • C. McDiarmid. On the method of bounded differences. In J. Siemons, editor, Surveys in Combinatorics, pages 148-188. Cambridge University Press, Cambridge, UK, 1989.
    • (1989) Surveys in Combinatorics , pp. 148-188
    • McDiarmid, C.1
  • 25
    • 51249173817 scopus 로고
    • Randomized rounding: A technique for provably good algorithms and algorithmic proofs
    • P. Raghavan and C. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7, 1987.
    • (1987) Combinatorica , vol.7
    • Raghavan, P.1    Thompson, C.2
  • 27
    • 0036346557 scopus 로고    scopus 로고
    • Hop-by-hop routing algorithms for premium-class traffic in diffserv networks
    • New York, NY, June
    • J. Wang and K. Nahrstedt. Hop-by-hop routing algorithms for premium-class traffic in diffserv networks. In Proc. of IEEE INFOCOM 2002, New York, NY, June 2002.
    • (2002) Proc. of IEEE INFOCOM 2002
    • Wang, J.1    Nahrstedt, K.2


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