{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T13:57:36Z","timestamp":1722866256338},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T00:00:00Z","timestamp":1632009600000},"content-version":"vor","delay-in-days":1479,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1016\/j.tcs.2017.07.004","type":"journal-article","created":{"date-parts":[[2017,7,17]],"date-time":"2017-07-17T14:01:34Z","timestamp":1500300094000},"page":"66-78","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["On the minimum eccentricity shortest path problem"],"prefix":"10.1016","volume":"694","author":[{"given":"Feodor F.","family":"Dragan","sequence":"first","affiliation":[]},{"given":"Arne","family":"Leitert","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2017.07.004_br0010","series-title":"Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005)","first-page":"225","article-title":"Low-distortion embeddings of general metrics into the line","author":"B\u0103doiu","year":"2005"},{"key":"10.1016\/j.tcs.2017.07.004_br0020","series-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005)","first-page":"119","article-title":"Approximation algorithms for low-distortion embeddings into low-dimensional spaces","author":"B\u01cedoiu","year":"2005"},{"key":"10.1016\/j.tcs.2017.07.004_br0030","series-title":"COCOA 2016: 10th Annual International Conference on Combinatorial Optimization and Applications","first-page":"216","article-title":"Minimum eccentricity shortest path problem: an approximation algorithm and relation with the k-laminarity problem","volume":"vol. 10043","author":"Birmel\u00e9","year":"2016"},{"key":"10.1016\/j.tcs.2017.07.004_br0040","first-page":"292","article-title":"Linear time algorithms for dominating pairs in asteroidal triple-free graphs","volume":"28","author":"Corneil","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2017.07.004_br0050","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/j.dam.2011.10.032","article-title":"Bandwidth and distortion revisited","volume":"160","author":"Cygan","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2017.07.004_br0060","series-title":"COCOON 2010: 16th Annual International Computing and Combinatorics Conference","first-page":"216","article-title":"Optimal binary space partitions in the plane","volume":"vol. 6196","author":"de Berg","year":"2010"},{"key":"10.1016\/j.tcs.2017.07.004_br0070","series-title":"WG 1995: 21st International Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"344","article-title":"Diametral path graphs","volume":"vol. 1017","author":"Deogun","year":"1995"},{"key":"10.1016\/j.tcs.2017.07.004_br0080","series-title":"Fundamentals of Parameterized Complexity","author":"Downey","year":"2013"},{"key":"10.1016\/j.tcs.2017.07.004_br0090","series-title":"SWAT 2014: 14th Scandinavian Symposium and Workshops on Algorithm Theory","first-page":"146","article-title":"Line-distortion, bandwidth and path-length of a graph","volume":"vol. 8503","author":"Dragan","year":"2014"},{"key":"10.1016\/j.tcs.2017.07.004_br0100","series-title":"WG 2015: 41st International Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"189","article-title":"Minimum eccentricity shortest paths in some structured graph classes","volume":"vol. 9224","author":"Dragan","year":"2015"},{"key":"10.1016\/j.tcs.2017.07.004_br0110","series-title":"WADS 2015: 14th International Symposium on Algorithms and Data Structures","first-page":"276","article-title":"On the minimum eccentricity shortest path problem","volume":"vol. 9214","author":"Dragan","year":"2015"},{"key":"10.1016\/j.tcs.2017.07.004_br0120","series-title":"ICALP 2009: 36th International Colloquium on Automata, Languages and Programming","first-page":"463","article-title":"Distortion is fixed parameter tractable","volume":"vol. 5555","author":"Fellows","year":"2009"},{"key":"10.1016\/j.tcs.2017.07.004_br0130","doi-asserted-by":"crossref","first-page":"3530","DOI":"10.1016\/j.tcs.2011.02.043","article-title":"An exact algorithm for minimum distortion embedding","volume":"412","author":"Fomin","year":"2011","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2017.07.004_br0140","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.ipl.2010.02.009","article-title":"Hardness and approximation of minimum distortion embeddings","volume":"110","author":"Heggernes","year":"2010","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.tcs.2017.07.004_br0150","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1016\/j.tcs.2011.01.005","article-title":"Computing minimum distortion embeddings into a path of bipartite permutation graphs and threshold graphs","volume":"412","author":"Heggernes","year":"2011","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2017.07.004_br0160","series-title":"FOCS 2001: 42nd Annual Symposium on Foundations of Computer Science","first-page":"10","article-title":"Algorithmic applications of low-distortion geometric embeddings","author":"Indyk","year":"2001"},{"key":"10.1016\/j.tcs.2017.07.004_br0170","series-title":"Handbook of Discrete and Computational Geometry","first-page":"177","article-title":"Low-distortion embeddings of finite metric spaces","author":"Indyk","year":"2004"},{"key":"10.1016\/j.tcs.2017.07.004_br0180","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0166-218X(99)00128-6","article-title":"Domination and total domination on asteroidal triple-free graphs","volume":"99","author":"Kratsch","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2017.07.004_br0190","series-title":"Tree-Breadth of Graphs with Variants and Applications","author":"Leitert","year":"2017"},{"key":"10.1016\/j.tcs.2017.07.004_br0200","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(95)00057-4","article-title":"Hamiltonian circuits in chordal bipartite graphs","volume":"156","author":"M\u00fcller","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2017.07.004_br0210","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.16.1.1","article-title":"Locating central paths in a graph","volume":"16","author":"Slater","year":"1982","journal-title":"Transp. Sci."},{"key":"10.1016\/j.tcs.2017.07.004_br0220","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","article-title":"A global geometric framework for nonlinear dimensionality reduction","volume":"290","author":"Tenenbaum","year":"2000","journal-title":"Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751730542X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751730542X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T01:00:54Z","timestamp":1632013254000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439751730542X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":22,"alternative-id":["S030439751730542X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2017.07.004","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2017,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the minimum eccentricity shortest path problem","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2017.07.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}