{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:43:58Z","timestamp":1742957038967,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031270505"},{"type":"electronic","value":"9783031270512"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-27051-2_15","type":"book-chapter","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:03:35Z","timestamp":1678665815000},"page":"167-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Better Hardness Results for the Minimum Spanning Tree Congestion Problem"],"prefix":"10.1007","author":[{"given":"Huong","family":"Luu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Chrobak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,13]]},"reference":[{"issue":"10","key":"15_CR1","first-page":"1","volume":"141","author":"F Alvarruiz Bermejo","year":"2015","unstructured":"Alvarruiz Bermejo, F., Mart\u00ednez Alzamora, F., Vidal Maci\u00e1, A.M.: Improving the efficiency of the loop method for the simulation of water distribution networks. J. Water Resour. Plan. Manag. 141(10), 1\u201310 (2015)","journal-title":"J. Water Resour. Plan. Manag."},{"doi-asserted-by":"crossref","unstructured":"Bencz\u00far, A.A., Karger, D.R.: Approximating $$s-t$$ minimum cuts in $$\\tilde{O}(n^2)$$ time. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 47\u201355 (1996)","key":"15_CR2","DOI":"10.1145\/237814.237827"},{"doi-asserted-by":"crossref","unstructured":"Bhatt, S., Chung, F., Leighton, T., Rosenberg, A.: Optimal simulations of tree machines. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pp. 274\u2013282 (1986)","key":"15_CR3","DOI":"10.1109\/SFCS.1986.38"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-011-9565-7","volume":"64","author":"H Bodlaender","year":"2012","unstructured":"Bodlaender, H., Fomin, F., Golovach, P., Otachi, Y., Leeuwen, E.: Parameterized complexity of the spanning tree congestion problem. Algorithmica 64, 1\u201327 (2012)","journal-title":"Algorithmica"},{"issue":"12","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1016\/j.disc.2011.03.002","volume":"311","author":"HL Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Kozawa, K., Matsushima, T., Otachi, Y.: Spanning tree congestion of k-outerplanar graphs. Discret. Math. 311(12), 1040\u20131045 (2011)","journal-title":"Discret. Math."},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S0895480192237403","volume":"8","author":"L Cai","year":"1995","unstructured":"Cai, L., Corneil, D.G.: Tree spanners. SIAM J. Discret. Math. 8(3), 359\u2013387 (1995)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864\u2013894 (1994)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1016\/j.jcss.2010.10.002","volume":"77","author":"FF Dragan","year":"2011","unstructured":"Dragan, F.F., Fomin, F.V., Golovach, P.A.: Spanners in sparse graphs. J. Comput. Syst. Sci. 77(6), 1108\u20131119 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1137\/060666202","volume":"38","author":"Y Emek","year":"2009","unstructured":"Emek, Y., Peleg, D.: Approximating minimum max-stretch spanning trees on unweighted graphs. SIAM J. Comput. 38(5), 1761\u20131781 (2009)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0166-218X(00)00226-2","volume":"108","author":"SP Fekete","year":"2001","unstructured":"Fekete, S.P., Kremer, J.: Tree spanners in planar graphs. Discret. Appl. Math. 108(1), 85\u2013103 (2001)","journal-title":"Discret. Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Fung, W.S., Hariharan, R., Harvey, N.J., Panigrahi, D.: A general framework for graph sparsification. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp. 71\u201380 (2011)","key":"15_CR11","DOI":"10.1145\/1993636.1993647"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0020-0190(94)90044-2","volume":"50","author":"S Khuller","year":"1994","unstructured":"Khuller, S., Raghavachari, B., Young, N.: Designing multi-commodity flow trees. Inf. Process. Lett. 50(1), 49\u201355 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"15_CR13","doi-asserted-by":"publisher","first-page":"753","DOI":"10.7151\/dmgt.1577","volume":"31","author":"K Kozawa","year":"2011","unstructured":"Kozawa, K., Otachi, Y.: Spanning tree congestion of rook\u2019s graphs. Discuss. Math. Graph Theory 31(4), 753\u2013761 (2011)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"13","key":"15_CR14","doi-asserted-by":"publisher","first-page":"4215","DOI":"10.1016\/j.disc.2008.12.021","volume":"309","author":"K Kozawa","year":"2009","unstructured":"Kozawa, K., Otachi, Y., Yamazaki, K.: On spanning tree congestion of graphs. Discret. Math. 309(13), 4215\u20134224 (2009)","journal-title":"Discret. Math."},{"unstructured":"L\u00f6wenstein, C.: In the Complement of a Dominating Set. Ph.D. thesis, Technische Universitat Ilmenau (2010)","key":"15_CR15"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-642-20877-5_44","volume-title":"Theory and Applications of Models of Computation","author":"Y Okamoto","year":"2011","unstructured":"Okamoto, Y., Otachi, Y., Uehara, R., Uno, T.: Hardness results and an exact exponential algorithm for the spanning tree congestion problem. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648, pp. 452\u2013462. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20877-5_44"},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.disc.2004.02.009","volume":"285","author":"M Ostrovskii","year":"2004","unstructured":"Ostrovskii, M.: Minimal congestion trees. Discret. Math. 285(1), 219\u2013226 (2004)","journal-title":"Discret. Math."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-030-42071-0_12","volume-title":"Treewidth, Kernels, and Algorithms","author":"Y Otachi","year":"2020","unstructured":"Otachi, Y.: A survey on spanning tree congestion. In: Fomin, F.V., Kratsch, S., van Leeuwen, E.J. (eds.) Treewidth, Kernels, and Algorithms. LNCS, vol. 12160, pp. 165\u2013172. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-42071-0_12"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-16926-7_3","volume-title":"Graph Theoretic Concepts in Computer Science","author":"Y Otachi","year":"2010","unstructured":"Otachi, Y., Bodlaender, H.L., van Leeuwen, E.J.: Complexity results for the spanning tree congestion problem. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 3\u201314. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16926-7_3"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/BFb0040384","volume-title":"VLSI Algorithms and Architectures","author":"AL Rosenberg","year":"1988","unstructured":"Rosenberg, A.L.: Graph embeddings 1988: recent breakthroughs, new directions. In: Reif, J.H. (ed.) AWOC 1988. LNCS, vol. 319, pp. 160\u2013169. Springer, New York (1988). https:\/\/doi.org\/10.1007\/BFb0040384"},{"issue":"4","key":"15_CR21","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1137\/08074489X","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman, D.A., Teng, S.H.: Spectral sparsification of graphs. SIAM J. Comput. 40(4), 981\u20131025 (2011)","journal-title":"SIAM J. Comput."},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-32033-3_18","volume-title":"Term Rewriting and Applications","author":"R Yoshinaka","year":"2005","unstructured":"Yoshinaka, R.: Higher-order matching in the linear lambda calculus in the absence of constants is NP-complete. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 235\u2013249. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-32033-3_18"}],"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-031-27051-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T06:12:51Z","timestamp":1729059171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27051-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031270505","9783031270512"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27051-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 March 2023","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 Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hsinchu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"22 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.walcom2023.conf.nycu.edu.tw\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"40% - 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":"10","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)"}},{"value":"This proceeding includes 2 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}