{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:35:42Z","timestamp":1757309742737,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49190-0_10","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"141-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Shortest Longest-Path Graph Orientations"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Asahiro","sequence":"first","affiliation":[]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[]},{"given":"Avraham A.","family":"Melkman","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]},{"given":"Quan","family":"Xue","sequence":"additional","affiliation":[]},{"given":"Shay","family":"Zakov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"441","DOI":"10.7155\/jgaa.00371","volume":"19","author":"Y Asahiro","year":"2015","unstructured":"Asahiro, Y., Jansson, J., Miyano, E., Ono, H.: Graph orientations optimizing the number of light or heavy vertices. J. Graph Algorithms Appl. 19(1), 441\u2013465 (2015)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s10878-009-9276-z","volume":"22","author":"Y Asahiro","year":"2011","unstructured":"Asahiro, Y., Jansson, J., Miyano, E., Ono, H., Zenmyo, K.: Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22(1), 78\u201396 (2011)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"687","DOI":"10.7155\/jgaa.00435","volume":"21","author":"G Borradaile","year":"2017","unstructured":"Borradaile, G., Iglesias, J., Migler, T., Ochoa, A., Wilfong, G., Zhang, L.: Egalitarian graph orientations. J. Graph Algorithms Appl. 21(4), 687\u2013708 (2017)","journal-title":"J. Graph Algorithms Appl."},{"issue":"16","key":"10_CR4","doi-asserted-by":"publisher","first-page":"2043","DOI":"10.1016\/j.dam.2007.05.018","volume":"155","author":"KY Chen","year":"2007","unstructured":"Chen, K.Y., Chao, K.M.: On the range maximum-sum segment query problem. Discret. Appl. Math. 155(16), 2043\u20132052 (2007)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(91)90020-3","volume":"86","author":"M Chrobak","year":"1991","unstructured":"Chrobak, M., Eppstein, D.: Planar orientations with low out-degree and compaction of adjacency matrices. Theoret. Comput. Sci. 86(2), 243\u2013266 (1991)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0012-365X(80)90236-8","volume":"30","author":"DP Dailey","year":"1980","unstructured":"Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discret. Math. 30(3), 289\u2013293 (1980)","journal-title":"Discret. Math."},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0095-8956(79)90048-0","volume":"26","author":"RW Deming","year":"1979","unstructured":"Deming, R.W.: Acyclic orientations of a graph and chromatic and independence numbers. J. Comb. Theory B 26(1), 101\u2013110 (1979)","journal-title":"J. Comb. Theory B"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/15427951.2011.604554","volume":"7","author":"M Elberfeld","year":"2011","unstructured":"Elberfeld, M., et al.: On the approximability of reachability-preserving network orientations. Internet Math. 7(4), 209\u2013232 (2011)","journal-title":"Internet Math."},{"issue":"6","key":"10_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0020-0190(90)90215-J","volume":"33","author":"Z Galil","year":"1990","unstructured":"Galil, Z., Park, K.: A linear-time algorithm for concave one-dimensional dynamic programming. Inf. Process. Lett. 33(6), 309\u2013311 (1990)","journal-title":"Inf. Process. Lett."},{"key":"10_CR10","unstructured":"Gallai, T.: On directed graphs and circuits. In: Theory of Graphs (Proceedings of the Colloquium held at Tihany 1966), pp. 115\u2013118. Akad\u00e9miai Kiad\u00f3 (1968)"},{"key":"10_CR11","volume-title":"Computers and Intractability - A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: Proceedings of the Nineteenth Annual Symposium on Foundations of Computer Science (FOCS 1978), pp. 8\u201321. IEEE Computer Society (1978)","DOI":"10.1109\/SFCS.1978.3"},{"issue":"5\u20136","key":"10_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/mana.19650280503","volume":"28","author":"M Hasse","year":"1965","unstructured":"Hasse, M.: Zur algebraischen Begr\u00fcndung der Graphentheorie. I. Mathematische Nachrichten 28(5\u20136), 275\u2013290 (1965)","journal-title":"I. Mathematische Nachrichten"},{"issue":"1\u20132","key":"10_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00230-G","volume":"147","author":"K Jansen","year":"1995","unstructured":"Jansen, K., M\u00fcller, H.: The minimum broadcast time problem for several processor networks. Theoret. Comput. Sci. 147(1\u20132), 69\u201385 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Proceedings of Complexity of Computer Computations, pp. 85\u2013103. The IBM Research Symposia Series, Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10_CR16","unstructured":"Klawe, M.M.: A simple linear time algorithm for concave one-dimensional dynamic programming. Technical Report 89\u201316, Department of Computer Science, University of British Columbia (1989)"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/0196-6774(91)90016-R","volume":"12","author":"LL Larmore","year":"1991","unstructured":"Larmore, L.L., Schieber, B.: On-line dynamic programming with applications to the prediction of RNA secondary structure. J. Algorithms 12(3), 490\u2013515 (1991)","journal-title":"J. Algorithms"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-87361-7_19","volume-title":"Algorithms in Bioinformatics","author":"A Medvedovsky","year":"2008","unstructured":"Medvedovsky, A., Bafna, V., Zwick, U., Sharan, R.: An algorithm for orienting graphs based on cause-effect pairs and its applications to orienting protein networks. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS, vol. 5251, pp. 222\u2013232. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87361-7_19"},{"issue":"5","key":"10_CR19","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1051\/m2an\/1967010501291","volume":"1","author":"B Roy","year":"1967","unstructured":"Roy, B.: Nombre chromatique et plus longs chemins d\u2019un graphe. Revue fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle 1(5), 129\u2013132 (1967)","journal-title":"Revue fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle"},{"issue":"1\u20133","key":"10_CR20","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.dam.2003.07.007","volume":"143","author":"V Venkateswaran","year":"2004","unstructured":"Venkateswaran, V.: Minimizing maximum indegree. Discret. Appl. Math. 143(1\u20133), 374\u2013378 (2004)","journal-title":"Discret. Appl. Math."},{"key":"10_CR21","unstructured":"Vitaver, L.M.: Determination of minimal coloring of vertices of a graph by means of Boolean powers of the incidence matrix (in Russian). In: Proceedings of the USSR Academy of Sciences, vol. 147, pp. 758\u2013759. Nauka (1967)"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theory Comput. 3(1), 103\u2013128 (2007)","journal-title":"Theory Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49190-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:09:20Z","timestamp":1702026560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}