메뉴 건너뛰기




Volumn 7, Issue 4, 2011, Pages

An improved approximation algorithm for RESOURCE ALLOCATION

Author keywords

Approximation algorithm; Call admission control; Resource allocation

Indexed keywords

APPROXIMATION RESULTS; FINISH TIME; NP-HARD; POLYNOMIAL-TIME; RESOURCE ALLOCATION PROBLEM; RESOURCE REQUIREMENTS;

EID: 80053488211     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/2000807.2000816     Document Type: Article
Times cited : (39)

References (8)
  • 1
    • 0023500313 scopus 로고
    • Scheduling jobs with fixed start and end times
    • ARKIN, E. M. AND SILVERBERG, E. B. 1987. Scheduling jobs with fixed start and end times. Disc. Appl. Math. 18, 1-8.
    • (1987) Disc. Appl. Math. , vol.18 , pp. 1-8
    • Arkin, E.M.1    Silverberg, E.B.2
  • 2
    • 0001334002 scopus 로고    scopus 로고
    • A unified approach to approximating resource allocation and scheduling
    • BAR-NOY, A., BAR-YEHUDA, R., FREUND, A., (SEFFI) NAOR, J., AND SCHIEBER, B. 2001. A unified approach to approximating resource allocation and scheduling. J. A C M 4 8, 1069-1090.
    • (2001) J. A C M , vol.4 , Issue.8 , pp. 1069-1090
    • Bar-Noy, A.1    Bar-Yehuda, R.2    Freund, A.3    Naor, J.4    Schieber, B.5
  • 5
    • 0028516246 scopus 로고
    • Maximizing the value of a space mission
    • HALL, N. G. AND MAGAZINE, M. J. 1994. Maximizing the value of a space mission. Europ. J. Operat. Res. 78, 2, 224-241.
    • (1994) Europ. J. Operat. Res. , vol.78 , Issue.2 , pp. 224-241
    • Hall, N.G.1    Magazine, M.J.2
  • 6
    • 84947783842 scopus 로고    scopus 로고
    • Approximation algorithms for bandwidth and storage allocation problems under real time constraints
    • LEONARDI, S., MARCHETTI-SPACCAMELA, A., AND VITALETTI, A. 2000. Approximation algorithms for bandwidth and storage allocation problems under real time constraints. In Proceedings of FSTTCS, Lecture Notes in Computer Science Series, vol. 1974. Springer, 409-420. (Pubitemid 33209798)
    • (2000) Lecture Notes in Computer Science , Issue.1974 , pp. 409-420
    • Leonardi, S.1    Marchetti-Spaccamela, A.2    Vitaletti, A.3
  • 7
    • 0027554501 scopus 로고
    • A faster strongly polynomial minimum cost flow algorithm
    • ORLIN, J. B. 1993. A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41, 2, 338-350.
    • (1993) Oper. Res. , vol.41 , Issue.2 , pp. 338-350
    • Orlin, J.B.1
  • 8
    • 0347699574 scopus 로고    scopus 로고
    • Off-line admission control for general scheduling problems
    • PHILLIPS, C. A., UMA, R. N., AND WEIN, J. 2000. Off-line admission control for general scheduling problems. J. Sched. 3, 6, 365-381.
    • (2000) J. Sched. , vol.3 , Issue.6 , pp. 365-381
    • Phillips, C.A.1    Uma, R.N.2    Wein, J.3


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