{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:13:53Z","timestamp":1725484433371},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438663"},{"type":"electronic","value":"9783540454717"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45471-3_32","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T17:18:22Z","timestamp":1179767902000},"page":"308-317","source":"Crossref","is-referenced-by-count":0,"title":["Call Control with k Rejections"],"prefix":"10.1007","author":[{"given":"R. Sai","family":"Anand","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Erlebach","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Hall","sequence":"additional","affiliation":[]},{"given":"Stamatis","family":"Stefanakos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"32_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-45535-3_2","volume-title":"Proceedings of the 8th Integer Programming and Combinatorial Optimization Conference (IPCO)","author":"Y. Azar","year":"2001","unstructured":"Y. Azar and O. Regev. Strongly polynomial algorithms for the unsplittable flow problem. In Proceedings of the 8th Integer Programming and Combinatorial Optimization Conference (IPCO), LNCS 2081, pages 15\u201329, 2001."},{"key":"32_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44634-6_15","volume-title":"Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001)","author":"A. Blum","year":"2001","unstructured":"A. Blum, A. Kalai, and J. Kleinberg. Admission control to minimize rejections. In Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001), LNCS 2125, pages 155\u2013164, 2001."},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H. L. Bodlaender","year":"1998","unstructured":"H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1\u201345, 1998.","journal-title":"Theoretical Computer Science"},{"key":"32_CR4","unstructured":"A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(93)E0174-W","volume":"59","author":"M. C. Carlisle","year":"1995","unstructured":"M. C. Carlisle and E. L. Lloyd. On the k-coloring of intervals. Discrete Applied Mathematics, 59:225\u2013235, 1995.","journal-title":"Discrete Applied Mathematics"},{"key":"32_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-46784-X_30","volume-title":"Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG\u201999)","author":"J. Chen","year":"1999","unstructured":"J. Chen, I. A. Kanj, and 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), LNCS 1665, pages 313\u2013324, 1999."},{"volume-title":"Parameterized Complexity","year":"1997","author":"R. Downey","key":"32_CR7","unstructured":"R. Downey and M. Fellows. Parameterized Complexity. Springer-Verlag, New York, 1997."},{"key":"32_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-44683-4_31","volume-title":"Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS 2001)","author":"T. Erlebach","year":"2001","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), LNCS 2136, pages 351\u2013362, 2001."},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1137\/S0895480199361259","volume":"14","author":"T. Erlebach","year":"2001","unstructured":"T. Erlebach and K. Jansen. The maximum edge-disjoint paths problem in bidirected trees. SIAM Journal on Discrete Mathematics, 14(3):326\u2013355, 2001.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"N. Garg, V. V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18(1):3\u201320, 1997.","journal-title":"Algorithmica"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and 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), pages 19\u201328, 1999.","DOI":"10.1145\/301250.301262"},{"key":"32_CR12","unstructured":"J. Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1996."},{"key":"32_CR13","unstructured":"J. Kleinberg and E. Tardos. Disjoint paths in densely embedded graphs. In Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS\u201995), pages 52\u201361, 1995."},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"R. Niedermeier and P. Rossmanith. An efficient fixed parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms, 2(1), 2001.","DOI":"10.1016\/S1570-8667(03)00009-1"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0166-218X(01)00223-2","volume":"115","author":"T. Nishizeki","year":"2001","unstructured":"T. Nishizeki, J. Vygen, and X. Zhou. The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discrete Applied Mathematics, 115:177\u2013186, 2001.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45471-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T20:36:17Z","timestamp":1550349377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45471-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438663","9783540454717"],"references-count":15,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45471-3_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}