{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:34:43Z","timestamp":1760441683783,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_10","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"129-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A 4-Approximation of the $$\\frac{2\\pi }{3}$$-MST"],"prefix":"10.1007","author":[{"given":"Stav","family":"Ashur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Ackerman, E., Gelander, T., Pinchasi, R.: Ice-creams and wedge graphs. Comput. Geom. 46(3), 213\u2013218 (2013). http:\/\/dx.doi.org\/10.1016\/j.comgeo.2012.07.003","DOI":"10.1016\/j.comgeo.2012.07.003"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., et al.: Maximizing maximal angles for plane straight-line graphs. Comput. Geom. 46(1), 17\u201328 (2013). http:\/\/dx.doi.org\/10.1016\/j.comgeo.2012.03.002","DOI":"10.1016\/j.comgeo.2012.03.002"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Aschner, R., Katz, M.J.: Bounded-angle spanning tree: modeling networks with angular constraints. Algorithmica 77(2), 349\u2013373 (2017). http:\/\/dx.doi.org\/10.1007\/s00453-015-0076-9","DOI":"10.1007\/s00453-015-0076-9"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Aschner, R., Katz, M.J., Morgenstern, G.: Symmetric connectivity with directional antennas. Comput. Geom. 46(9), 1017\u20131026 (2013). http:\/\/dx.doi.org10.1016\/j.comgeo.2013.06.003\/","DOI":"10.1016\/j.comgeo.2013.06.003"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Ashur, S., Katz, M.J.: A 4-approximation of the $$\\frac{2\\pi }{3}$$-MST. CoRR, abs\/2010.11571 (2020). https:\/\/arxiv.org\/abs\/2010.11571","DOI":"10.1007\/978-3-030-83508-8_10"},{"key":"10_CR6","unstructured":"Biniaz, A., Bose, P., Lubiw, A., Maheshwari, A.: Bounded-angle minimum spanning trees. In: 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, 22\u201324 June 2020, T\u00f3rshavn, Faroe Islands, pp. 14:1\u201314:22 (2020). https:\/\/dx.doi.org\/10.4230\/LIPIcs.SWAT.2020.14"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Carmi, P., Katz, M.J., Lotker, Z., Ros\u00e9n, A.: Connectivity guarantees for wireless networks with directional antennas. Comput. Geom. 44(9), 477\u2013485 (2011). http:\/\/dx.doi.org\/10.1016\/j.comgeo.2011.05.003","DOI":"10.1016\/j.comgeo.2011.05.003"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Euclidean bounded-degree spanning tree ratios. Discret. Comput. Geom. 32(2), 177\u2013194 (2004). http:\/\/www.springerlink.com\/index\/10.1007\/s00454-004-1117-3","DOI":"10.1007\/s00454-004-1117-3"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Khuller, S., Klemmstein, M., Raghavachari, B., Young, N.E.: A network-flow technique for finding low-weight bounded-degree spanning trees. J. Algorithms 24(2), 310\u2013324 (1997). http:\/\/dx.doi.org\/10.1006\/jagm.1997.0862","DOI":"10.1006\/jagm.1997.0862"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Jothi, R., Raghavachari, B.: Degree-bounded minimum spanning trees. Discret. Appl. Math. 157(5), 960\u2013970 (2009). http:\/\/dx.doi.org\/10.1016\/j.dam.2008.03.037","DOI":"10.1016\/j.dam.2008.03.037"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Khuller, S., Raghavachari, B., Young, N.E.: Low-degree spanning trees of small weight. SIAM J. Comput. 25(2), 355\u2013368 (1996). http:\/\/dx.doi.org\/10.1137\/S0097539794264585","DOI":"10.1137\/S0097539794264585"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Monma, C.L., Suri, S.: Transitions in geometric minimum spanning trees. Discret. Comput. Geom. 8, 265\u2013293 (1992). http:\/\/dx.doi.org\/10.1007\/BF02293049","DOI":"10.1007\/BF02293049"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the traveling salesman problem. J. Algorithms 5(2), 231\u2013246 (1984). http:\/\/dx.doi.org\/10.1016\/0196-6774(84)90029-4","DOI":"10.1016\/0196-6774(84)90029-4"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:25:50Z","timestamp":1645183550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","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":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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":"38% - 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.1","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":"13","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)"}}]}}