{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:03:36Z","timestamp":1743113016385,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617912"},{"type":"electronic","value":"9783030617929"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-61792-9_2","type":"book-chapter","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:15:48Z","timestamp":1606943748000},"page":"15-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees"],"prefix":"10.1007","author":[{"given":"Ran","family":"Duan","sequence":"first","affiliation":[]},{"given":"Haoqing","family":"He","sequence":"additional","affiliation":[]},{"given":"Tianyi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,3]]},"reference":[{"issue":"4","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1137\/080734340","volume":"39","author":"N Bansal","year":"2009","unstructured":"Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree-bounded directed network design. SIAM J. Comput. 39(4), 1413\u20131431 (2009)","journal-title":"SIAM J. Comput."},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/11538462_3","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"K Chaudhuri","year":"2005","unstructured":"Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: What would edmonds do? augmenting paths and witnesses for degree-bounded MSTs. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX\/RANDOM -2005. LNCS, vol. 3624, pp. 26\u201339. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11538462_3"},{"key":"2_CR3","first-page":"1277","volume":"11","author":"Y Dinitz","year":"1970","unstructured":"Dinitz, Y.: Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl. 11, 1277\u20131280 (1970)","journal-title":"Soviet Math. Dokl."},{"key":"2_CR4","unstructured":"Fischer, T.: Optimizing the degree of minimum weight spanning trees. Cornell University, Technical report (1993)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P.: Approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode. In: Proceedings of the 9th Annual European Symposium on Algorithms, pp. 440\u2013451 (2001)","DOI":"10.1007\/3-540-44676-1_37"},{"key":"2_CR6","unstructured":"F\u00fcrer, M., Raghavachari, B.: An NC approximation algorithm for the minimum degree spanning tree problem. In: Proceedings of the 28th Annual Allerton Conference on Communication, Control and Computing, pp. 274\u2013281 (1990)"},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/jagm.1994.1042","volume":"17","author":"M F\u00fcrer","year":"1994","unstructured":"F\u00fcrer, M., Raghavachari, B.: Approximating the minimum-degree Steiner tree to within one of optimal. J. Algorithms 17(3), 409\u2013423 (1994)","journal-title":"J. Algorithms"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Goemans, M.X.: Minimum bounded degree spanning trees. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006, pp. 273\u2013282. IEEE (2006)","DOI":"10.1109\/FOCS.2006.48"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/net.20031","volume":"44","author":"PN Klein","year":"2004","unstructured":"Klein, P.N., Krishnan, R., Raghavachari, B., Ravi, R.: Approximation algorithms for finding low-degree subgraphs. Networks 44(3), 203\u2013215 (2004)","journal-title":"Networks"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Ravi, R.: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 537\u2013546. ACM (2000)","DOI":"10.1145\/335305.335371"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Ravi, R.: Primal-dual meets local search: approximating mst\u2019s with nonuniform degree bounds. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 389\u2013395. ACM (2003)","DOI":"10.1145\/780542.780600"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-45294-X_20","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"R Krishnan","year":"2001","unstructured":"Krishnan, R., Raghavachari, B.: The directed minimum-degree spanning tree problem. In: Hariharan, R., Vinay, V., Mukund, M. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 232\u2013243. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45294-X_20"},{"key":"2_CR13","unstructured":"Ravi, R.: Rapid rumor ramification: approximating the minimum broadcast time. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 202\u2013213. IEEE (1994)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 661\u2013670. ACM (2007)","DOI":"10.1145\/1250790.1250887"},{"issue":"17","key":"2_CR15","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1016\/j.disc.2007.07.105","volume":"308","author":"G Yao","year":"2008","unstructured":"Yao, G., Zhu, D., Li, H., Ma, S.: A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem. Discrete Math. 308(17), 3951\u20133959 (2008)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","LATIN 2020: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61792-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:18:54Z","timestamp":1606943934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61792-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617912","9783030617929"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61792-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sao Paulo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2020.ime.usp.br\/","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":"136","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":"50","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":"37% - 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,16","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the symposium was moved from May 2020 to January 2021.","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)"}}]}}