{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:32:03Z","timestamp":1745944323166,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2002.1019250","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T18:04:13Z","timestamp":1056564253000},"page":"94-103","source":"Crossref","is-referenced-by-count":11,"title":["On-line admission control and packet scheduling with interleaving"],"prefix":"10.1109","volume":"1","author":[{"given":"J.A.","family":"Garay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.S.","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Yener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Peng Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"0","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/90.556345"},{"key":"15","first-page":"292","article-title":"Computational complexity of approximation algorithms for combinatorial problems","volume":"74","author":"gens","year":"1979","journal-title":"Mathematical Foundations of Computer Science"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1060"},{"article-title":"Computers and intractability: A guide to the theory of NP-completeness","year":"1979","author":"garey","key":"13"},{"year":"1999","key":"14","article-title":"Data-over-cable service interface specification radio frequency interface specification SP-RFIv1.1-101-990311"},{"key":"11","first-page":"396","article-title":"Patience is a virtue: The effect of slack on competitiveness for admission control","author":"goldwasser","year":"1999","journal-title":"Proc 9th Annu ACM-SIAM on Discrete Algorithms"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/18.623149"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196305124"},{"article-title":"Quality of service in IP networks","year":"2000","author":"armitage","key":"2"},{"journal-title":"Atlanta ATM ICs","year":"0","key":"1"},{"article-title":"Competitive analysis of call admission algorithms that allow delay","year":"1995","author":"feldman","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/BF00365406"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/12.620484"},{"key":"5","first-page":"27","article-title":"A local-ratio theorem for approximating the weighted vertex cover problem","volume":"25","author":"bar-yehuda","year":"1985","journal-title":"Annals of Discrete Mathematics"},{"journal-title":"Online Computation and Competitive Analysis","year":"1998","author":"borodin","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1002\/jos.85"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0459-9"}],"event":{"name":"IEEE Information Communications Conference (INFOCOM 2002)","acronym":"INFCOM-02","location":"New York, NY, USA"},"container-title":["Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7943\/21921\/01019250.pdf?arnumber=1019250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T16:55:57Z","timestamp":1489164957000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1019250\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/infcom.2002.1019250","relation":{},"subject":[]}}