메뉴 건너뛰기




Volumn 15, Issue , 2004, Pages 86-95

The Directed Circular Arrangement Problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA REDUCTION; LINEAR PROGRAMMING; METRIC SYSTEM; PROBLEM SOLVING; SCHEDULING; THEOREM PROVING;

EID: 1842421158     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2)

References (10)
  • 2
    • 0001545727 scopus 로고    scopus 로고
    • Divide and Conquer Approximation Algorithms via Spreading Metrics
    • G. Even, J. Naor, S. Rao, and B. Schieber, Divide and Conquer Approximation Algorithms via Spreading Metrics, Journal of the ACM, Vol. 47, No. 4, 2000, pp. 585-616.
    • (2000) Journal of the ACM , vol.47 , Issue.4 , pp. 585-616
    • Even, G.1    Naor, J.2    Rao, S.3    Schieber, B.4
  • 3
    • 0033340828 scopus 로고    scopus 로고
    • Fast Approximate Graph Partitioning Algorithms
    • G. Even, J. Naor, S. Rao, and B. Schieber, Fast Approximate Graph Partitioning Algorithms, SIAM Journal on Computing, Vol.28, No.6, 1998, pp. 2187-2214.
    • (1998) SIAM Journal on Computing , vol.28 , Issue.6 , pp. 2187-2214
    • Even, G.1    Naor, J.2    Rao, S.3    Schieber, B.4
  • 4
    • 0000255727 scopus 로고    scopus 로고
    • Approximating minimum feedback sets and multicuts in directed graphs
    • G. Even, J. Naor, B. Schieber and M. Sudan, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica, Vol. 20 (1998) pp. 151-174.
    • (1998) Algorithmica , vol.20 , pp. 151-174
    • Even, G.1    Naor, J.2    Schieber, B.3    Sudan, M.4
  • 5
    • 0030127682 scopus 로고    scopus 로고
    • Approximate max-flow min-(multi) cut theorems and their applications
    • N. Garg, V.V. Vazirani, and M. Yannakakis, Approximate max-flow min-(multi) cut theorems and their applications, SIAM Journal on Computing, Vol. 25, 1996, pp. 235-251.
    • (1996) SIAM Journal on Computing , vol.25 , pp. 235-251
    • Garg, N.1    Vazirani, V.V.2    Yannakakis, M.3
  • 6
    • 0000651166 scopus 로고    scopus 로고
    • Multicommodity max-flow mincut theorems and their use in designing approximation algorithms
    • T. Leighton and S. Rao, Multicommodity max-flow mincut theorems and their use in designing approximation algorithms Journal of the ACM, Vol. 46, No.6, 1999, pp. 787-832.
    • (1999) Journal of the ACM , vol.46 , Issue.6 , pp. 787-832
    • Leighton, T.1    Rao, S.2
  • 7
    • 84869193453 scopus 로고    scopus 로고
    • Circular Arrangements
    • V. Liberatore, Circular Arrangements, Proc. 29th ICALP, 2002, pp. 1054-1065. Also: Technical Report EECS-02-11, 2002.
    • (2002) Proc. 29th ICALP , pp. 1054-1065
    • Liberatore, V.1
  • 8
    • 84869193453 scopus 로고    scopus 로고
    • V. Liberatore, Circular Arrangements, Proc. 29th ICALP, 2002, pp. 1054-1065. Also: Technical Report EECS-02-11, 2002.
    • (2002) Technical Report , vol.EECS-02-11
  • 9
    • 0032258738 scopus 로고    scopus 로고
    • New Approximation Techniques for Some Ordering Problems
    • S. Rao and A. Richa, New Approximation Techniques for Some Ordering Problems, Proc. 9th SODA, 1998, pp. 211-218.
    • (1998) Proc. 9th SODA , pp. 211-218
    • Rao, S.1    Richa, A.2
  • 10
    • 34249756824 scopus 로고
    • Packing Directed Circuits Fractionally
    • P. Seymour, Packing Directed Circuits Fractionally, Combinatorica, No.15, 1995, pp.281-288.
    • (1995) Combinatorica , Issue.15 , pp. 281-288
    • Seymour, P.1


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