{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:31:38Z","timestamp":1774557098398,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819778003","type":"print"},{"value":"9789819778010","type":"electronic"}],"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_2","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"15-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Representation of\u00a0Dominating Set Variants Using Dataless Neural Networks"],"prefix":"10.1007","author":[{"given":"Sangram K.","family":"Jena","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Wojciechowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.tcs.2015.09.023","volume":"609","author":"T Akiba","year":"2016","unstructured":"Akiba, T., Iwata, Y.: Branch-and-reduce exponential\/FPT algorithms in practice: a case study of vertex cover. Theoret. Comput. Sci. 609, 211\u2013225 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Alkhouri, I.R., Atia, G.K., Velasquez, A.: A differentiable approach to the maximum independent set problem using dataless neural networks. Neural Netw. 155, 168\u2013176 (2022)","DOI":"10.1016\/j.neunet.2022.08.008"},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Boppana, R., Halld\u00f3rsson, M.M.: Approximating maximum independent sets by excluding subgraphs. BIT Numer. Math. 32(2), 180\u2013196 (1992)","DOI":"10.1007\/BF01994876"},{"key":"2_CR5","volume-title":"D\u00e1niel Marx","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D.: D\u00e1niel Marx. Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, Marcin Pilipczuk (2015)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Das, G.K., Ghosh, S.C., Nandy, S.C.: An efficient heuristic algorithm for 2D h-hops range assignment problem. In: IEEE Global Telecommunications Conference, 2004. GLOBECOM\u201904., vol. 2, pp. 1051\u20131055. IEEE (2004)","DOI":"10.1109\/GLOCOM.2004.1378118"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Das, G.K., Ghosh, S.C., Nandy, S.C.: Improved algorithm for minimum cost range assignment problem for linear radio networks. Int. J. Found. Comput. Sci. 18(03), 619\u2013635 (2007)","DOI":"10.1142\/S0129054107004863"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"De, M., Das,G.K., Carmi, P., Nandy, S.C.: Approximation algorithms for a variant of discrete piercing set problem for unit disks. Int. J. Comput. Geom. Appl. 23(06), 461\u2013477 (2013)","DOI":"10.1142\/S021819591350009X"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Drori, I.: Learning to solve combinatorial optimization problems on real-world graphs in linear time. In: 2020 19th IEEE International Conference on Machine Learning and Applications (ICMLA), pp. 19\u201324 (2020)","DOI":"10.1109\/ICMLA51294.2020.00013"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Festa, P.: A brief introduction to exact, approximation, and heuristic algorithms for solving hard combinatorial optimization problems. In: 2014 16th International Conference on Transparent Optical Networks (ICTON), pp. 1\u201320 (2014)","DOI":"10.1109\/ICTON.2014.6876285"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X","DOI":"10.1007\/3-540-29953-X"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7","DOI":"10.1007\/978-3-642-16533-7"},{"key":"2_CR13","unstructured":"Gaspers, S.: Exponential Time Algorithms - Structures, Measures, and Bounds. VDM (2010)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Jena, S.K., Das, G.K.: Vertex-edge domination in unit disk graphs. Discrete Appl. Math. 319, 351\u2013361 (2022)","DOI":"10.1016\/j.dam.2021.06.002"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Jena, S.K., Subramani, K., Velasquez, A.: Differentiable discrete optimization using dataless neural networks. In: International Conference on Combinatorial Optimization and Applications, pp. 3\u201315. Springer (2023)","DOI":"10.1007\/978-3-031-49614-1_1"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Jena, S.K., Subramani, K., Velasquez, A.: A differential approach for several NP-hard optimization problems. In: International Symposium on Artificial Intelligence and Mathematics (2024)","DOI":"10.1007\/978-3-031-63735-3_4"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Lamm, S., Sanders, P., Schulz, C., Strash, D., Werneck, R.F.: Finding near-optimal independent sets at scale. In: 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 138\u2013150 (2016)","DOI":"10.1137\/1.9781611974317.12"},{"key":"2_CR18","unstructured":"Li, Z., Chen, Q., Koltun, V.: Combinatorial optimization with graph convolutional networks and guided tree search. Adv. Neural Inf. Proc. Syst. 31 (2018)"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"105400","DOI":"10.1016\/j.cor.2021.105400","volume":"134","author":"N Mazyavkina","year":"2021","unstructured":"Mazyavkina, N., Sviridov, S., Ivanov, S., Burnaev, E.: Reinforcement learning for combinatorial optimization: a survey. Comput. Oper. Res. 134, 105400 (2021)","journal-title":"Comput. Oper. Res."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"San\u00a0Segundo, P., Rodr\u00edguez-Losada, D., Jim\u00e9nez, A.: An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res. 38(2), 571\u2013581 (2011)","DOI":"10.1016\/j.cor.2010.07.019"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Schuetz, M.J.A., Brubaker, J.K., Katzgraber, H.G.: Combinatorial optimization with physics-inspired graph neural networks. Nat. Mach. Intell. 4(4), 367\u2013377 (2022)","DOI":"10.1038\/s42256-022-00468-6"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Wilder, B., Dilkina, B., Tambe, M.: Melding the data-decisions pipeline: decision-focused learning for combinatorial optimization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 1658\u20131665 (2019)","DOI":"10.1609\/aaai.v33i01.33011658"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:07:53Z","timestamp":1726769273000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7801-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819778003","9789819778010"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7801-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}