메뉴 건너뛰기




Volumn 4168 LNCS, Issue , 2006, Pages 64-75

Resource allocation in bounded degree trees

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FREQUENCY ALLOCATION; PROBLEM SOLVING; SET THEORY;

EID: 33750736641     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_9     Document Type: Conference Paper
Times cited : (11)

References (16)
  • 2
    • 0000455611 scopus 로고
    • Decomposition by clique separators
    • Tarjan, R.E.: Decomposition by clique separators. Discrete Mathematics 55 (1985) 221-232
    • (1985) Discrete Mathematics , vol.55 , pp. 221-232
    • Tarjan, R.E.1
  • 5
    • 0347699574 scopus 로고    scopus 로고
    • Off-line admission control for general scheduling problems
    • Phillips, C., Uma, R.N., Wein, J.: Off-line admission control for general scheduling problems. Journal of Scheduling 3 (2000) 365-381
    • (2000) Journal of Scheduling , vol.3 , pp. 365-381
    • Phillips, C.1    Uma, R.N.2    Wein, J.3
  • 6
    • 84947783842 scopus 로고    scopus 로고
    • Approximation algorithms for bandwidth and storage allocation problems under real time constraints
    • 20th Conference on Foundations of Software Technology and Theoretical Computer Science
    • Leonardi, S., Marchetti-Spaccamela, A., Vitaletti, A.: Approximation algorithms for bandwidth and storage allocation problems under real time constraints. In: 20th Conference on Foundations of Software Technology and Theoretical Computer Science. Volume 1974 of LNCS. (2000) 409-420
    • (2000) LNCS , vol.1974 , pp. 409-420
    • Leonardi, S.1    Marchetti-Spaccamela, A.2    Vitaletti, A.3
  • 7
    • 0001334002 scopus 로고    scopus 로고
    • A unified approach to approximating resource allocation and schedualing
    • Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Shieber, B.: A unified approach to approximating resource allocation and schedualing, J. ACM 48 (2001) 1069-1090
    • (2001) J. ACM , vol.48 , pp. 1069-1090
    • Bar-Noy, A.1    Bar-Yehuda, R.2    Freund, A.3    Naor, J.4    Shieber, B.5
  • 8
    • 85023843371 scopus 로고    scopus 로고
    • Allocation of bandwidth and storage
    • Chen, B., Hassin, R., Tzur, M.: Allocation of bandwidth and storage. IIE Transactions 34 (2002) 501-507
    • (2002) IIE Transactions , vol.34 , pp. 501-507
    • Chen, B.1    Hassin, R.2    Tzur, M.3
  • 9
    • 84868632657 scopus 로고    scopus 로고
    • Improved approximation algorithms for resource allocation
    • 9th International Integer Programming and Combinatorial Optimization Conference
    • Calinescu, G., Chakrabarti, A., Karloff, H.J., Rabani, Y.: Improved approximation algorithms for resource allocation. In: 9th International Integer Programming and Combinatorial Optimization Conference. Volume 2337 of LNCS. (2002) 401-414
    • (2002) LNCS , vol.2337 , pp. 401-414
    • Calinescu, G.1    Chakrabarti, A.2    Karloff, H.J.3    Rabani, Y.4
  • 10
    • 84957021733 scopus 로고    scopus 로고
    • Approximation algorithms for the unsplittable flow problem
    • 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
    • Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. In: 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. Volume 2462 of LNCS. (2002) 51-66
    • (2002) LNCS , vol.2462 , pp. 51-66
    • Chakrabarti, A.1    Chekuri, C.2    Gupta, A.3    Kumar, A.4
  • 11
    • 35248848767 scopus 로고    scopus 로고
    • Multicommodity demand flow in a tree
    • 30th Annual International Colloquium on Automata, Languages and Programming
    • Chekuri, C., Mydlarz, M., Shepherd, B.: Multicommodity demand flow in a tree. In: 30th Annual International Colloquium on Automata, Languages and Programming. Volume 2719 of LNCS. (2003) 410-425
    • (2003) LNCS , vol.2719 , pp. 410-425
    • Chekuri, C.1    Mydlarz, M.2    Shepherd, B.3
  • 12
    • 21044443608 scopus 로고    scopus 로고
    • Admission control in networks with advance reservations
    • Lewin-Eytan, L., Naor, J., Orda, A.: Admission control in networks with advance reservations. Algorithmica 40 (2004) 293-403
    • (2004) Algorithmica , vol.40 , pp. 293-403
    • Lewin-Eytan, L.1    Naor, J.2    Orda, A.3
  • 14
    • 0002392504 scopus 로고
    • A local-ratio theorem for approximating the weighted vertex cover problem
    • Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25 (1985) 27-46
    • (1985) Annals of Discrete Mathematics , vol.25 , pp. 27-46
    • Bar-Yehuda, R.1    Even, S.2
  • 15
    • 0000113012 scopus 로고    scopus 로고
    • A 2-approximation algorithm for the undirected feedback vertex set problem
    • Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Disc. Math. 12 (1999) 289-297
    • (1999) SIAM J. Disc. Math. , vol.12 , pp. 289-297
    • Bafna, V.1    Berman, P.2    Fujito, T.3
  • 16
    • 0000198539 scopus 로고    scopus 로고
    • One for the price of two: A unified approach for approximating covering problems
    • Bar-Yehuda, R.: One for the price of two: A unified approach for approximating covering problems. Algorithmica 27 (2000) 131-144
    • (2000) Algorithmica , vol.27 , pp. 131-144
    • Bar-Yehuda, R.1


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