{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:09Z","timestamp":1759639089917,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105631"},{"type":"electronic","value":"9783030105648"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-10564-8_9","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"108-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Klootwijk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bodo","family":"Manthey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sander K.","family":"Visser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.13.1.1","volume":"13","author":"S Ahn","year":"1988","unstructured":"Ahn, S., Cooper, C., Cornu\u00e9jols, G., Frieze, A.: Probabilistic analysis of a relaxation for the k-median problem. Math. Oper. Res. 13(1), 1\u201331 (1988). https:\/\/doi.org\/10.1287\/moor.13.1.1","journal-title":"Math. Oper. Res."},{"issue":"5","key":"9_CR2","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1017\/S096354831100023X","volume":"20","author":"S Bhamidi","year":"2011","unstructured":"Bhamidi, S., van der Hofstad, R., Hooghiemstra, G.: First passage percolation on the Erd\u0151s-R\u00e9nyi random graph. Comb. Probab. Comput. 20(5), 683\u2013707 (2011). https:\/\/doi.org\/10.1017\/S096354831100023X","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s00453-014-9901-9","volume":"73","author":"K Bringmann","year":"2015","unstructured":"Bringmann, K., Engels, C., Manthey, B., Rao, B.V.R.: Random shortest paths: non-Euclidean instances for metric optimization problems. Algorithmica 73(1), 42\u201362 (2015). https:\/\/doi.org\/10.1007\/s00453-014-9901-9","journal-title":"Algorithmica"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Byrka, J., Pensyl, T., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for $$k$$-median, and positive correlation in budgeted optimization. In: Indyk, P. (ed.) Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 737\u2013756 (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.50","DOI":"10.1137\/1.9781611973730.50"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0020-0190(93)90059-I","volume":"46","author":"R Davis","year":"1993","unstructured":"Davis, R., Prieditis, A.: The expected length of a shortest path. Inf. Process. Lett. 46(3), 135\u2013141 (1993). https:\/\/doi.org\/10.1016\/0020-0190(93)90059-I","journal-title":"Inf. Process. Lett."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/0-306-48213-4_7","volume-title":"The Traveling Salesman Problem and Its Variations","author":"AM Frieze","year":"2007","unstructured":"Frieze, A.M., Yukich, J.E.: Probabilistic analysis of the TSP (Chap. 7). In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, pp. 257\u2013307. Springer, Boston (2007). https:\/\/doi.org\/10.1007\/0-306-48213-4_7"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-49750-6_7","volume-title":"Bernoulli 1713 Bayes 1763 Laplace 1813","author":"JM Hammersley","year":"1965","unstructured":"Hammersley, J.M., Welsh, D.J.A.: First-passage percolation, subadditive processes, stochastic networks, and generalized renewal theory. In: Neyman, J., Le Cam, L.M. (eds.) Bernoulli 1713 Bayes 1763 Laplace 1813, pp. 61\u2013110. Springer, Heidelberg (1965). https:\/\/doi.org\/10.1007\/978-3-642-49750-6_7"},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1287\/moor.10.4.557","volume":"10","author":"R Hassin","year":"1985","unstructured":"Hassin, R., Zemel, E.: On shortest paths in graphs with random weights. Math. Oper. Res. 10(4), 557\u2013564 (1985). https:\/\/doi.org\/10.1287\/moor.10.4.557","journal-title":"Math. Oper. Res."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-662-09444-0_3","volume-title":"Probability on Discrete Structures","author":"CD Howard","year":"2004","unstructured":"Howard, C.D.: Models of first-passage percolation. In: Kesten, H. (ed.) Probability on Discrete Structures, pp. 125\u2013173. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-662-09444-0_3"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1017\/S0963548399003892","volume":"8","author":"S Janson","year":"1999","unstructured":"Janson, S.: One, two and three times log n\/n for paths in a complete graph with random weights. Comb. Probab. Comput. 8(4), 347\u2013361 (1999). https:\/\/doi.org\/10.1017\/S0963548399003892","journal-title":"Comb. Probab. Comput."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.spl.2017.11.017","volume":"135","author":"S Janson","year":"2018","unstructured":"Janson, S.: Tail bounds for sums of geometric and exponential variables. Stat. Probab. Lett. 135, 1\u20136 (2018). https:\/\/doi.org\/10.1016\/j.spl.2017.11.017","journal-title":"Stat. Probab. Lett."},{"key":"9_CR12","first-page":"181","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"RM Karp","year":"1985","unstructured":"Karp, R.M., Steele, J.M.: Probabilistic analysis of heuristics. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pp. 181\u2013205. Wiley, Hoboken (1985)"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0210050","volume":"10","author":"EM Reingold","year":"1981","unstructured":"Reingold, E.M., Tarjan, R.E.: On a greedy heuristic for complete matching. SIAM J. Comput. 10(4), 676\u2013681 (1981). https:\/\/doi.org\/10.1137\/0210050","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563\u2013581 (1977). https:\/\/doi.org\/10.1137\/0206041","journal-title":"SIAM J. Comput."},{"key":"9_CR15","volume-title":"Introduction to Probability Models","author":"SM Ross","year":"2010","unstructured":"Ross, S.M.: Introduction to Probability Models, 10th edn. Academic Press, Burlington (2010)","edition":"10"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:50:41Z","timestamp":1709823041000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","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":"30","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":"30% - 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":"9.8","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}