{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T12:40:00Z","timestamp":1734180000929,"version":"3.30.2"},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3516,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0022-0000(03)00076-x","type":"journal-article","created":{"date-parts":[[2003,11,20]],"date-time":"2003-11-20T13:03:07Z","timestamp":1069333387000},"page":"707-722","source":"Crossref","is-referenced-by-count":7,"title":["Call control with k rejections"],"prefix":"10.1016","volume":"67","author":[{"given":"R.","family":"Sai Anand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Erlebach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Hall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stamatis","family":"Stefanakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00076-X_BIB1","doi-asserted-by":"crossref","unstructured":"Y. Azar, O. Regev, Strongly polynomial algorithms for the unsplittable flow problem, in: Proceedings of the Eighth Integer Programming and Combinatorial Optimization Conference (IPCO), Lecture Notes in Computer Science, Vol. 2081, Springer, Berlin, 2001, pp. 15\u201329.","DOI":"10.1007\/3-540-45535-3_2"},{"key":"10.1016\/S0022-0000(03)00076-X_BIB2","doi-asserted-by":"crossref","unstructured":"A. Blum, A. Kalai, J. Kleinberg, Admission control to minimize rejections, in: Proceedings of the Seventh International Workshop on Algorithms and Data Structures (WADS 2001), Lecture Notes in Computer Science, Vol. 2125, Springer, Berlin, 2001, pp. 155\u2013164.","DOI":"10.1007\/3-540-44634-6_15"},{"key":"10.1016\/S0022-0000(03)00076-X_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","article-title":"A partial k-arboretum of graphs with bounded treewidth","volume":"209","author":"Bodlaender","year":"1998","journal-title":"Theoret. Comput. Sci."},{"year":"1998","series-title":"Online Computation and Competitive Analysis","author":"Borodin","key":"10.1016\/S0022-0000(03)00076-X_BIB4"},{"key":"10.1016\/S0022-0000(03)00076-X_BIB5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","article-title":"On the k-coloring of intervals","volume":"59","author":"Carlisle","year":"1995","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S0022-0000(03)00076-X_BIB6","doi-asserted-by":"crossref","unstructured":"J. Chen, I.A. Kanj, W. Jia, Vertex cover: further observations and further improvements, in: Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science WG\u201999, Lecture Notes in Computer Science, Vol. 1665, Springer, Berlin, 1999, pp. 313\u2013324.","DOI":"10.1007\/3-540-46784-X_30"},{"year":"1999","series-title":"Parameterized Complexity","author":"Downey","key":"10.1016\/S0022-0000(03)00076-X_BIB7"},{"key":"10.1016\/S0022-0000(03)00076-X_BIB8","doi-asserted-by":"crossref","unstructured":"T. Erlebach, Approximation algorithms and complexity results for path problems in trees of rings, in: Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS 2001), Lecture Notes in Computer Science, Vol. 2136, Springer, Berlin, 2001, pp. 351\u2013362.","DOI":"10.1007\/3-540-44683-4_31"},{"issue":"3","key":"10.1016\/S0022-0000(03)00076-X_BIB9","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1137\/S0895480199361259","article-title":"The maximum edge-disjoint paths problem in bidirected trees","volume":"14","author":"Erlebach","year":"2001","journal-title":"SIAM J. Disc. Math."},{"issue":"1","key":"10.1016\/S0022-0000(03)00076-X_BIB10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02523685","article-title":"Primal-dual approximation algorithms for integral flow and multicut in trees","volume":"18","author":"Garg","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0022-0000(03)00076-X_BIB11","doi-asserted-by":"crossref","unstructured":"V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, M. Yannakakis, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing STOC\u201999, 1999, pp. 19\u201328.","DOI":"10.1145\/301250.301262"},{"key":"10.1016\/S0022-0000(03)00076-X_BIB12","unstructured":"J. Kleinberg, Approximation algorithms for disjoint paths problems, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1996."},{"key":"10.1016\/S0022-0000(03)00076-X_BIB13","doi-asserted-by":"crossref","unstructured":"J. Kleinberg, \u00c9. Tardos, Disjoint paths in densely embedded graphs, in: Proceedings of the 36th Annual Symposium on Foundations of Computer Science FOCS\u201995, 1995, pp. 52\u201361.","DOI":"10.1109\/SFCS.1995.492462"},{"key":"10.1016\/S0022-0000(03)00076-X_BIB14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","article-title":"A general method to speed up fixed-parameter-tractable algorithms","volume":"73","author":"Niedermeier","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(03)00076-X_BIB15","doi-asserted-by":"crossref","unstructured":"R. Niedermeier, P. Rossmanith, An efficient fixed parameter algorithm for 3-Hitting Set, J. Discrete Algorithms (2003), to appear.","DOI":"10.1016\/S1570-8667(03)00009-1"},{"key":"10.1016\/S0022-0000(03)00076-X_BIB16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0166-218X(01)00223-2","article-title":"The edge-disjoint paths problem is NP-complete for series\u2013parallel graphs","volume":"115","author":"Nishizeki","year":"2001","journal-title":"Discrete Appl. Math."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000300076X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000300076X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T12:04:41Z","timestamp":1734177881000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002200000300076X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S002200000300076X"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00076-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}