{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:29:13Z","timestamp":1743103753891,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319741796"},{"type":"electronic","value":"9783319741802"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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-319-74180-2_20","type":"book-chapter","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T15:12:55Z","timestamp":1516029175000},"page":"235-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Simultaneous Minimum Spanning Trees Problem"],"prefix":"10.1007","author":[{"given":"Mat\u011bj","family":"Kone\u010dn\u00fd","sequence":"first","affiliation":[]},{"given":"Stanislav","family":"Ku\u010dera","sequence":"additional","affiliation":[]},{"given":"Jana","family":"Novotn\u00e1","sequence":"additional","affiliation":[]},{"given":"Jakub","family":"Pek\u00e1rek","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Smol\u00edk","sequence":"additional","affiliation":[]},{"given":"Jakub","family":"T\u011btek","sequence":"additional","affiliation":[]},{"given":"Martin","family":"T\u00f6pfer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"key":"20_CR1","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. arXiv.org:1204.5853 (2015)"},{"key":"20_CR2","first-page":"37","volume":"3","author":"O Bor\u016fvka","year":"1926","unstructured":"Bor\u016fvka, O.: O jist\u00e9m probl\u00e9mu minim\u00edln\u00edm (About a certain minimal problem) (Czech, German summary). Pr\u00e1ce mor. p\u0159\u00edrodov\u011bd. spol. v Brn\u011b III 3, 37\u201358 (1926)","journal-title":"Pr\u00e1ce mor. p\u0159\u00edrodov\u011bd. spol. v Brn\u011b III"},{"key":"20_CR3","first-page":"57","volume":"6","author":"V Jarn\u00edk","year":"1930","unstructured":"Jarn\u00edk, V.: O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. Pr\u00e1ce Moravsk\u00e9 P\u0159\u00edrodov\u011bdeck\u00e9 Spole\u010dnosti 6, 57\u201363 (1930)","journal-title":"Pr\u00e1ce Moravsk\u00e9 P\u0159\u00edrodov\u011bdeck\u00e9 Spole\u010dnosti"},{"issue":"6","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Labs Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Labs Tech. J."},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","volume":"7","author":"RL Graham","year":"1985","unstructured":"Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7(1), 43\u201357 (1985)","journal-title":"Ann. Hist. Comput."},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/505241.505243","volume":"49","author":"S Pettie","year":"2002","unstructured":"Pettie, S., Ramachandran, V.: An optimal minimum spanning tree algorithm. J. ACM (JACM) 49(1), 16\u201334 (2002)","journal-title":"J. ACM (JACM)"},{"key":"20_CR8","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, New York (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"20_CR9","series-title":"Combinatorial Structures and their Applications","first-page":"68","volume-title":"Submodular Functions, Matroids, and Certain Polyhedra","author":"J Edmonds","year":"1970","unstructured":"Edmonds, J.: Submodular Functions, Matroids, and Certain Polyhedra. Combinatorial Structures and their Applications, pp. 68\u201387. Gordon and Breach, New York (1970)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0015746","volume-title":"Automata, Languages and Programming","author":"HN Gabow","year":"1985","unstructured":"Gabow, H.N., Stallmann, M.: Efficient algorithms for graphic matroid intersection and parity. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 210\u2013220. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/BFb0015746"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74180-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:51:51Z","timestamp":1709826711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74180-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319741796","9783319741802"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74180-2_20","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 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/caldam2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}