{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T23:45:25Z","timestamp":1775000725200,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,21]],"date-time":"2006-05-21T00:00:00Z","timestamp":1148169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,5,21]]},"DOI":"10.1145\/1132516.1132617","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"721-729","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":60,"title":["A quasi-PTAS for unsplittable flow on line graphs"],"prefix":"10.1145","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[{"name":"IBM T. J. Watson Research Center, Yorktown Heights, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Chakrabarti","sequence":"additional","affiliation":[{"name":"Dartmouth College, Hanover, NH"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Epstein","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Yorktown Heights, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,5,21]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"31","volume-title":"Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Albers S.","year":"1999","unstructured":"S. Albers , S. Arora , and S. Khanna . Page replacement for general caching problems . In Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 31 -- 40 , 1999 .]] S. Albers, S. Arora, and S. Khanna. Page replacement for general caching problems. In Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 31--40, 1999.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.41"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060632"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645590.659925"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335410"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.25.2.255.12228"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference","volume":"2337","author":"Calinescu G.","year":"2001","unstructured":"G. Calinescu , A. Chakrabarti , H. Karloff , and Y. Rabani . Improved approximation algorithms for resource allocation . In Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference , volume 2337 of Lecture Notes in Computer Science, pages 439--456 , 2001 .]] G. Calinescu, A. Chakrabarti, H. Karloff, and Y. Rabani. Improved approximation algorithms for resource allocation. In Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference, volume 2337 of Lecture Notes in Computer Science, pages 439--456, 2001.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646689.703115"},{"key":"e_1_3_2_1_9_1","first-page":"628","volume-title":"Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Chekuri C.","year":"2003","unstructured":"C. Chekuri and S. Khanna . Edge disjoint paths revisited . In Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 628 -- 637 , 2003 .]] C. Chekuri and S. Khanna. Edge disjoint paths revisited. In Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 628--637, 2003.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_34"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523685"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301262"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90385-9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_16_1","unstructured":"J. M. Kleinberg. Approximation Algorithms for Disjoint Paths Problems. PhD thesis MIT 1996.]]   J. M. Kleinberg. Approximation Algorithms for Disjoint Paths Problems. PhD thesis MIT 1996.]]"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/338219.338654"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480195294994"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796366"}],"event":{"name":"STOC06: Symposium on Theory of Computing","location":"Seattle WA USA","acronym":"STOC06","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132617","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1132516.1132617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:13Z","timestamp":1750259173000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,21]]},"references-count":19,"alternative-id":["10.1145\/1132516.1132617","10.1145\/1132516"],"URL":"https:\/\/doi.org\/10.1145\/1132516.1132617","relation":{},"subject":[],"published":{"date-parts":[[2006,5,21]]},"assertion":[{"value":"2006-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}