메뉴 건너뛰기




Volumn 6139 LNCS, Issue , 2010, Pages 420-431

Minimizing the diameter of a network using shortcut edges

Author keywords

Approximation algorithms; network design; network repair

Indexed keywords

APPROXIMATION RATIOS; CONSTANT FACTORS; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; K-MEDIAN PROBLEM; NETWORK DESIGN; NETWORK REPAIR; RESOURCE AUGMENTATION;

EID: 77954647135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13731-0_39     Document Type: Conference Paper
Times cited : (91)

References (11)
  • 2
    • 0036149420 scopus 로고    scopus 로고
    • Networks on chips: A new SoC paradigm
    • DOI 10.1109/2.976921
    • Benini, L., De Micheli, G.: Networks on chips: A new SoC paradigm. Computer 35(1), 70-78 (2002) (Pubitemid 34069383)
    • (2002) Computer , vol.35 , Issue.1 , pp. 70-78
    • Benini, L.1    De Micheli, G.2
  • 7
    • 0032108328 scopus 로고    scopus 로고
    • A threshold of ln n for approximating set cover
    • Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634-652 (1998)
    • (1998) Journal of the ACM , vol.45 , Issue.4 , pp. 634-652
    • Feige, U.1
  • 11
    • 70350594729 scopus 로고    scopus 로고
    • Minimizing average shortest path distances via shortcut edge addition
    • Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer, Heidelberg
    • Meyerson, A., Tagiku, B.: Minimizing average shortest path distances via shortcut edge addition. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. LNCS, vol. 5687, pp. 272-285. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5687 , pp. 272-285
    • Meyerson, A.1    Tagiku, B.2


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