{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:23:26Z","timestamp":1743038606398,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_5","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"62-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Approximability of Time Disjoint Walks"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Bayen","sequence":"first","affiliation":[]},{"given":"Jesse","family":"Goodman","sequence":"additional","affiliation":[]},{"given":"Eugene","family":"Vinitsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"5_CR1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"2012","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (2012)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-48523-6_17","volume-title":"Automata, Languages and Programming","author":"P Berman","year":"1999","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results (extended abstract). In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 200\u2013209. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_17"},{"issue":"9","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-33090-2_47","volume-title":"Algorithms \u2013 ESA 2012","author":"M Gro\u00df","year":"2012","unstructured":"Gro\u00df, M., Skutella, M.: Maximum multicommodity flows over time without intermediate storage. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 539\u2013550. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_47"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0022-0000(03)00066-7","volume":"67","author":"V Guruswami","year":"2003","unstructured":"Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67(3), 473\u2013496 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"RM Karp","year":"1975","unstructured":"Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5(1), 45\u201368 (1975)","journal-title":"Networks"},{"key":"5_CR7","unstructured":"Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. Ph.D. thesis. Massachusetts Institute of Technology (1996)"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.disopt.2010.05.002","volume":"7","author":"Y Kobayashi","year":"2010","unstructured":"Kobayashi, Y., Sommer, C.: On shortest disjoint paths in planar graphs. Discrete Optim. 7(4), 234\u2013245 (2010)","journal-title":"Discrete Optim."},{"key":"5_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T Lengauer","year":"2012","unstructured":"Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-322-92106-2"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Combin. Theor. Ser. B 63(1), 65\u2013110 (1995)","journal-title":"J. Combin. Theor. Ser. B"},{"key":"5_CR11","unstructured":"Scheffler, P.: A practical linear time algorithm for disjoint paths in graphs with bounded tree-width. TU, Fachbereich 3 (1994)"},{"key":"5_CR12","volume-title":"Paths, Flows, and VLSI-Layout","author":"A Schrijver","year":"1990","unstructured":"Schrijver, A., Lovasz, L., Korte, B., Promel, H.J., Graham, R.: Paths, Flows, and VLSI-Layout. Springer, New York (1990)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-76796-1_21","volume-title":"Research Trends in Combinatorial Optimization","author":"M Skutella","year":"2009","unstructured":"Skutella, M.: An introduction to network flows over time. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-76796-1_21"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Srinivas, A., Modiano, E.: Minimum energy disjoint path routing in wireless ad-hoc networks. In: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, pp. 122\u2013133. ACM (2003)","DOI":"10.1145\/938985.938999"},{"issue":"11","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1109\/26.179933","volume":"40","author":"D Torrieri","year":"1992","unstructured":"Torrieri, D.: Algorithms for finding an optimal set of short disjoint paths in a communication network. IEEE Trans. Commun. 40(11), 1698\u20131702 (1992)","journal-title":"IEEE Trans. Commun."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 681\u2013690. ACM (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:46:40Z","timestamp":1710344800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}