{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:12Z","timestamp":1759639092539,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"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_20","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T08:02:33Z","timestamp":1580112153000},"page":"236-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Maximum Edge-Pair Embedding Bipartite Matching"],"prefix":"10.1007","author":[{"given":"Cam Ly","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vorapong","family":"Suppakitpaisarn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athasit","family":"Surarerks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phanu","family":"Vajanopath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1006\/jcss.1997.1472","volume":"54","author":"S Arora","year":"1997","unstructured":"Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54(2), 317\u2013331 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1145\/1149283.1149286","volume":"2","author":"P Biswas","year":"2006","unstructured":"Biswas, P., Lian, T.C., Wang, T.C., Ye, Y.: Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sens. Netw. (TOSN) 2(2), 188\u2013220 (2006)","journal-title":"ACM Trans. Sens. Netw. (TOSN)"},{"key":"20_CR3","first-page":"23","volume":"2009","author":"M Charikar","year":"2009","unstructured":"Charikar, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for label cover problems. ESA 2009, 23\u201334 (2009)","journal-title":"ESA"},{"key":"20_CR4","unstructured":"Fleischner, H.: X. 1 algorithms for Eulerian trails. In: Eulerian Graphs and Related Topics: Part 1. Annals of Discrete Mathematics, vol. 50, pp. 1\u201313 (1991)"},{"issue":"20","key":"20_CR5","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.1016\/j.disc.2010.05.028","volume":"310","author":"H Fleischner","year":"2010","unstructured":"Fleischner, H., Sabidussi, G., Sarvanov, V.I.: Maximum independent sets in 3-and 4-regular Hamiltonian graphs. Discrete Math. 310(20), 2742\u20132749 (2010)","journal-title":"Discrete Math."},{"issue":"2","key":"20_CR6","first-page":"257","volume":"2","author":"M Fleury","year":"1883","unstructured":"Fleury, M.: Deux problemes de geometrie de situation. Journal de mathematiques elementaires 2(2), 257\u2013261 (1883)","journal-title":"Journal de mathematiques elementaires"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Ghafourian, A., Georgiou, O., Barter, E., Gross, T.: Wireless localization with diffusion maps. arXiv preprint arXiv:1908.05216 (2019)","DOI":"10.1038\/s41598-020-77695-7"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"MM Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M.M., Radhakrishnan, J.: Greed is good: approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18(1), 145\u2013163 (1997)","journal-title":"Algorithmica"},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Hu, L., Evans, D.: Localization for mobile sensor networks. In: MobiCom 2004, pp. 45\u201357 (2004)","DOI":"10.1145\/1023720.1023726"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Nguyen, C.L., Georgiou, O., Yonezawa, Y., Doi, Y.: The wireless localisation matching problem and a maximum likelihood based solution. In: ICC 2017, pp. 1\u20137 (2017)","DOI":"10.1109\/ICC.2017.7996458"},{"issue":"5","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/JIOT.2017.2723013","volume":"4","author":"CL Nguyen","year":"2017","unstructured":"Nguyen, C.L., Georgiou, O., Yonezawa, Y., Doi, Y.: The wireless localization matching problem. IEEE Internet Things J. 4(5), 1312\u20131326 (2017)","journal-title":"IEEE Internet Things J."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Nguyen, L., Georgiou, O., Suppakitpaisarn, V.: Improved localization accuracy using machine learning and refining RSS measurements. In: GLOBECOM Workshops 2018 (2018)","DOI":"10.1109\/GLOCOMW.2018.8644270"},{"key":"20_CR14","unstructured":"Skiena, S.: Coloring bipartite graphs, chap. 5.5.2. In: Skiena, S. (ed.) Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, p. 213. Addison-Wesley, Reading (1990)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Suppakitpaisarn, V., Dai, W., Baffier, J.F.: Robust network flow against attackers with knowledge of routing method. In: HPSR 2015, pp. 40\u201347 (2015)","DOI":"10.1109\/HPSR.2015.7483079"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T02:18:54Z","timestamp":1614133134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_20","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"}}]}}