{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:17:01Z","timestamp":1742984221469,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_9","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"94-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Angle Covers: Algorithms and Complexity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7611-507X","authenticated-orcid":false,"given":"William","family":"Evans","sequence":"first","affiliation":[]},{"given":"Ellen","family":"Gethner","sequence":"additional","affiliation":[]},{"given":"Jack","family":"Spalding-Jamieson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1), 123\u2013134 (2000). \nhttps:\/\/doi.org\/10.1016\/S0304-3975(98)00158-3","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating vertex cover. Ann. Math. 162(1), 439\u2013485 (2005). \nhttps:\/\/doi.org\/10.4007\/annals.2005.162.439","journal-title":"Ann. Math."},{"key":"9_CR3","unstructured":"Evans, W., Gethner, E., Spalding-Jamieson, J., Wolff, A.: Angle covers: algorithms and complexity. Arxiv (2019). \nhttp:\/\/arxiv.org\/abs\/1911.02040"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5(4), 691\u2013703 (1976). \nhttps:\/\/doi.org\/10.1137\/0205048","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.comgeo.2004.07.003","volume":"31","author":"R Haas","year":"2005","unstructured":"Haas, R., et al.: Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31(1), 31\u201361 (2005)","journal-title":"Comput. Geom."},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF02992822","volume":"39","author":"PC Kainen","year":"1973","unstructured":"Kainen, P.C.: Thickness and coarseness of graphs. Abh. Math. Semin. Univ. Hambg. 39(1), 88\u201395 (1973). \nhttps:\/\/doi.org\/10.1007\/BF02992822","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"key":"9_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2","volume-title":"Complexity of Computer Computations","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J., Bohlinger, J. (eds.) Complexity of Computer Computations, IBM Research Symposia, pp. 85\u2013103. Springer, Boston (1972). \nhttps:\/\/doi.org\/10.1007\/978-1-4684-2001-2"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within $$2-\\epsilon $$. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008). \nhttps:\/\/doi.org\/10.1016\/j.jcss.2007.06.019","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Micali, S., Vazirani, V.V.: An $${O}(\\sqrt{|V|}|{E}|)$$ algorithm for finding maximum matching in general graphs. In: Proceedings 21st Annual Symposium on Foundations of Computer Science (FOCS), pp. 17\u201327. IEEE (1980). \nhttps:\/\/doi.org\/10.1109\/SFCS.1980.12","DOI":"10.1109\/SFCS.1980.12"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Streinu, I.: A combinatorial approach to planar non-colliding robot arm motion planning. In: Proceedings 41st Annual Symposium on Foundations of Computer Science (FOCS), pp. 443\u2013453. IEEE (2000). \nhttps:\/\/doi.org\/10.1109\/SFCS.2000.892132","DOI":"10.1109\/SFCS.2000.892132"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:05:28Z","timestamp":1582139128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_9","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":"20 February 2020","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":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","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":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}