{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:52:38Z","timestamp":1743011558467,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":26,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819778003"},{"type":"electronic","value":"9789819778010"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-7801-0_19","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"220-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Construction of\u00a0Tessellation Cover to\u00a0QUBO Formulations"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Cunha","sequence":"first","affiliation":[]},{"given":"Franklin","family":"Marquezino","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Posner","sequence":"additional","affiliation":[]},{"given":"Matheus","family":"Romaneli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2020.11.045","volume":"858","author":"A Abreu","year":"2021","unstructured":"Abreu, A., et al.: A computational complexity comparative study of graph tessellation problems. Theoret. Comput. Sci. 858, 81\u201389 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.tcs.2019.09.013","volume":"801","author":"A Abreu","year":"2020","unstructured":"Abreu, A., et al.: The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness. Theoret. Comput. Sci. 801, 175\u2013191 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR3","first-page":"22","volume":"45","author":"A Abreu","year":"2017","unstructured":"Abreu, A., et al.: Bounds and complexity for the tessellation problem. Mat. Contemp. 45, 22\u201330 (2017)","journal-title":"Mat. Contemp."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-77404-6_1","volume-title":"LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings","author":"A Abreu","year":"2018","unstructured":"Abreu, A., et al.: The graph tessellation cover number: extremal bounds, efficient algorithms and hardness. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings, pp. 1\u201313. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_1"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.dam.2021.09.032","volume":"323","author":"A Abreu","year":"2022","unstructured":"Abreu, A., Cunha, L., Figueiredo, C., Marquezino, F., Posner, D., Portugal, R.: Total tessellation cover: Bounds, hardness, and applications. Discret. Appl. Math. 323, 149\u2013161 (2022)","journal-title":"Discret. Appl. Math."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.3389\/fphy.2019.00048","volume":"7","author":"M Aramon","year":"2019","unstructured":"Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., Katzgraber, H.G.: Physics-inspired optimization for quadratic unconstrained problems using a digital annealer. Front. Phys. 7, 48 (2019)","journal-title":"Front. Phys."},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TASC.2014.2318294","volume":"24","author":"PI Bunyk","year":"2014","unstructured":"Bunyk, P.I., et al.: Architectural considerations in the design of a superconducting quantum annealing processor. IEEE Trans. Appl. Supercond. 24(4), 1\u201310 (2014)","journal-title":"IEEE Trans. Appl. Supercond."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Chapuis, G., Djidjev, H., Hahn, G., Rizk, G.: Finding maximum cliques on a quantum annealer. In: Proceedings of the Computing Frontiers Conference, pp. 63\u201370 (2017)","DOI":"10.1145\/3075564.3075575"},{"key":"19_CR9","unstructured":"Djidjev, H.N., Chapuis, G., Hahn, G., Rizk, G.: Efficient combinatorial optimization using quantum annealing. arXiv preprint arXiv:1801.08653 (2018)"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10479-022-04634-2","volume":"314","author":"F Glover","year":"2022","unstructured":"Glover, F., Kochenberger, G., Hennig, R., Du, Y.: Quantum bridge analytics i: a tutorial on formulating and using QUBO models. Ann. Oper. Res. 314(1), 141\u2013183 (2022)","journal-title":"Ann. Oper. Res."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Goto, H., Tatsumura, K., Dixon, A.R.: Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems. Sci. Adv. 5(4), eaav2372 (2019)","DOI":"10.1126\/sciadv.aav2372"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10479-005-3449-7","volume":"139","author":"GA Kochenberger","year":"2005","unstructured":"Kochenberger, G.A., Glover, F., Alidaee, B., Rego, C.: An unconstrained quadratic binary programming approach to the vertex coloring problem. Ann. Oper. Res. 139, 229\u2013241 (2005)","journal-title":"Ann. Oper. Res."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"74887","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A.: Ising formulations of many NP problems. Front. Phys. 2, 74887 (2014)","journal-title":"Front. Phys."},{"key":"19_CR14","unstructured":"Xavier, P.M., Ripper, P., Andrade, T., Garcia, J.D., Maculan, N., Neira, D.E.B.: QUBO.jl: A Julia Ecosystem for Quadratic Unconstrained Binary Optimization (2023)"},{"key":"19_CR15","unstructured":"Matsuda, Y.: Research and development of common software platform for ising machines. In: 2020 IEICE General Conference (2020)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2021.02.021","volume":"863","author":"J McCollum","year":"2021","unstructured":"McCollum, J., Krauss, T.: QUBO formulations of the longest path problem. Theoret. Comput. Sci. 863, 86\u2013101 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"19_CR17","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MC.2019.2908836","volume":"52","author":"CC McGeoch","year":"2019","unstructured":"McGeoch, C.C., Harris, R., Reinhardt, S.P., Bunyk, P.I.: Practical annealing-based quantum computing. Computer 52(6), 38\u201346 (2019)","journal-title":"Computer"},{"key":"19_CR18","first-page":"287","volume":"129","author":"GA Pardo","year":"2016","unstructured":"Pardo, G.A., Avila, V.: A note on erdos-faber-lovasz conjecture and edge coloring of complete graphs. Ars Combin. 129, 287\u2013298 (2016)","journal-title":"Ars Combin."},{"issue":"4","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1007\/s11128-015-1230-7","volume":"15","author":"R Portugal","year":"2016","unstructured":"Portugal, R.: Establishing the equivalence between Szegedy\u2019s and coined quantum walks using the staggered model. Quantum Inf. Process. 15(4), 1387\u20131409 (2016)","journal-title":"Quantum Inf. Process."},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Portugal, R.: Element distinctness revisited. Quant. Inform. Process. 17(7), 1\u201315 (2018). https:\/\/doi.org\/10.1007\/s11128-018-1930-x","DOI":"10.1007\/s11128-018-1930-x"},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s11128-015-1149-z","volume":"15","author":"R Portugal","year":"2016","unstructured":"Portugal, R., Santos, R.A.M., Fernandes, T.D., Gon\u00e7alves, D.N.: The staggered quantum walk model. Quantum Inf. Process. 15(1), 85\u2013101 (2016)","journal-title":"Quantum Inf. Process."},{"issue":"6","key":"19_CR22","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.88.061010","volume":"88","author":"K Tanahashi","year":"2019","unstructured":"Tanahashi, K., Takayanagi, S., Motohashi, T., Tanaka, S.: Application of ising machines and a software development for ising machines. J. Phys. Soc. Jpn. 88(6), 061010 (2019)","journal-title":"J. Phys. Soc. Jpn."},{"issue":"5","key":"19_CR23","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1007\/s11128-012-0432-5","volume":"11","author":"S Venegas-Andraca","year":"2012","unstructured":"Venegas-Andraca, S.: Quantum walks: a comprehensive review. Quantum Inf. Process. 11(5), 1015\u20131106 (2012)","journal-title":"Quantum Inf. Process."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Yamaoka, M., Okuyama, T., Hayashi, M., Yoshimura, C., Takemoto, T.: Cmos annealing machine: an in-memory computing accelerator to process combinatorial optimization problems. In: 2019 IEEE Custom Integrated Circuits Conference (CICC), pp. 1\u20138. IEEE (2019)","DOI":"10.1109\/CICC.2019.8780296"},{"issue":"10","key":"19_CR25","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ac8c54","volume":"85","author":"S Yarkoni","year":"2022","unstructured":"Yarkoni, S., Raponi, E., B\u00e4ck, T., Schmitt, S.: Quantum annealing for industry applications: Introduction and review. Rep. Prog. Phys. 85(10), 104001 (2022)","journal-title":"Rep. Prog. Phys."},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Zielinski, S.,\u00a0N, J.\u00a0Stein, J., Gabor, T., Linnhoff-Popien, C., Feld, S.: Pattern QUBOs: algorithmic construction of 3SAT-to-QUBO transformations. Electronics 12(16), 3492 (2023)","DOI":"10.3390\/electronics12163492"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7801-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:08:57Z","timestamp":1726769337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7801-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819778003","9789819778010"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7801-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}