{"type":"ScholarlyArticle","title":"Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory","authors":[{"name":"Julien Baste","slug":"julien-baste","given":"Julien","family":"Baste","affiliation":"Ulm University , Germany"},{"name":"Michael R. Fellows","slug":"michael-r-fellows","given":"Michael R.","family":"Fellows","affiliation":"University of Bergen , Norway"},{"name":"Lars Jaffke","slug":"lars-jaffke","given":"Lars","family":"Jaffke","affiliation":"University of Bergen , Norway"},{"name":"Tomáš Masařík","slug":"tomas-masarik","given":"Tomáš","family":"Masařík","affiliation":"University of Warsaw , Poland; Charles University , Czech Republic"},{"name":"Mateus de Oliveira Oliveira","slug":"mateus-de-oliveira-oliveira","given":"Mateus","family":"de Oliveira Oliveira","affiliation":"University of Bergen , Norway"},{"name":"Geevarghese Philip","slug":"geevarghese-philip","given":"Geevarghese","family":"Philip","affiliation":"Chennai Mathematical Institute , India; UMI ReLaX"},{"name":"Frances A. Rosamond","slug":"frances-a-rosamond","given":"Frances A.","family":"Rosamond","affiliation":"University of Bergen , Norway"}],"abstract":"When modeling an application of practical relevance as an instance of a combinatorial problem X, we are often interested not merely in finding one optimal solution for that instance, but in finding a sufficiently diverse collection of good solutions. In this work we initiate a systematic study of diversity from the point of view of fixed-parameter tractability theory. We consider an intuitive notion of diversity of a collection of solutions which suits a large variety of combinatorial problems of practical interest. Our main contribution is an algorithmic framework which --automatically-- converts a tree-decomposition-based dynamic programming algorithm for a given combinatorial problem X into a dynamic programming algorithm for the diverse version of X. Surprisingly, our algorithm has a polynomial dependence on the diversity parameter.","doi":"10.24963/ijcai.2020/156","url":"https://ijcai.org/proceedings/2020/156","pdf":"https://ijcai.org/proceedings/2020/0156.pdf","markdown":"https://ijcai.org/proceedings/2020/156.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/156","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Constraints and SAT","track":"Main track","number":156,"pages":{"first":1119,"last":1125},"keywords":["Constraints and SAT: Constraint Satisfaction","Constraints and SAT: Constraint Optimization"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/25329/file_25329.m3u8","length_sec":271,"provider":"hls"}],"references":[{"position":1,"raw":"[Abbassi et al., 2013] Zeinab Abbassi, Vahab S. Mirrokni, and Mayur Thakur. Diversity maximization under matroid constraints. 19th KDD, pages 32-40, 2013.","title":"Diversity maximization under matroid constraints","authors":"Zeinab Abbassi, S Vahab, Mayur Mirrokni, Thakur","year":"2013","venue":"19th KDD","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Adomavicius and Kwon, 2014] Gediminas Adomavicius and YoungOk Kwon. Optimization-based approaches for maximizing aggregate recommendation diversity. INFORMS Journal on Computing, 26(2):351-369, 2014.","title":"Gediminas Adomavicius and YoungOk Kwon. Optimization-based approaches for maximizing aggregate recommendation diversity","authors":"Kwon Adomavicius","year":"2014","venue":"INFORMS Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Barrett et al., 2007] Chris Barrett, Harry B Hunt, Madhav V Marathe, SS Ravi, Daniel J Rosenkrantz, Richard E Stearns, and Mayur Thakur. Computational aspects of an- alyzing social network dynamics. In 20th IJCAI, pages 2268-2273, 2007.","title":"Computational aspects of analyzing social network dynamics","authors":"Chris Barrett, Harry B Hunt, Madhav V Marathe, Daniel J Ravi, Richard E Rosenkrantz, Mayur Stearns, Thakur","year":"2007","venue":"20th IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2007/365"},{"position":4,"raw":"[Baste et al., 2019a] Julien Baste, Michael R. Fellows, Lars Jaffke, Tomáš Masařík, Mateus de Oliveira Oliveira, Gee- varghese Philip, and Frances A. Rosamond. Diversity of solutions: An exploration through the lens of fixed- parameter tractability theory, 2019. arXiv:1903.07410.","title":"Diversity of solutions: An exploration through the lens of fixedparameter tractability theory","authors":"Baste","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Baste et al., 2019b] Julien Baste, Lars Jaffke, Tomáš Masařík, Geevarghese Philip, and Günter Rote. FPT algo- rithms for diverse collections of hitting sets. Algorithms, 12:254, 2019.","title":"FPT algorithms for diverse collections of hitting sets","authors":"Baste","year":"2019","venue":"Algorithms","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bliem et al., 2017] Bernhard Bliem, Marius Moldovan, Michael Morak, and Stefan Woltran. The impact of treewidth on ASP grounding and solving. In 26th IJCAI, pages 852-858, 2017.","title":"The impact of treewidth on ASP grounding and solving","authors":"Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran","year":"2017","venue":"26th IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/118"},{"position":7,"raw":"[Bodirsky and Wölfl, 2011] Manuel Bodirsky and Stefan Wölfl. RCC8 is polynomial on networks of bounded treewidth. In 22nd IJCAI, Vol. 2, pages 756-761, 2011.","title":"RCC8 is polynomial on networks of bounded treewidth","authors":"Manuel Bodirsky, Stefan Wölfl","year":"2011","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/133"},{"position":8,"raw":"[Buss and Goldsmith, 1993] Jonathan F. Buss and Judy Goldsmith. Nondeterminism within P. SIAM J. Comput., 22(3):560-572, 1993.","title":"Nondeterminism within P","authors":"Jonathan F Buss, Judy Goldsmith","year":"1993","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Carbonnel and Hebrard, 2016] Clément Carbonnel and Em- manuel Hebrard. Propagation via kernelization: The ver- tex cover constraint. In 22nd CP, pages 147-156, 2016.","title":"Propagation via kernelization: The vertex cover constraint","authors":"Hebrard Carbonnel, Clément Carbonnel, Emmanuel Hebrard","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Chavira and Darwiche, 2007] Mark Chavira and Adnan Darwiche. Compiling Bayesian networks using variable elimination. In 20th IJCAI, pages 2443-2449, 2007.","title":"Compiling Bayesian networks using variable elimination","authors":"Darwiche Chavira, Mark Chavira, Adnan Darwiche","year":"2007","venue":"20th IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2007/393"},{"position":11,"raw":"[Courcelle, 1990] Bruno Courcelle. The monadic second- order logic of graphs. I. recognizable sets of finite graphs. Inform. Comput., 85(1):12-75, 1990.","title":"The monadic secondorder logic of graphs. I. recognizable sets of finite graphs","authors":"Bruno Courcelle","year":"1990","venue":"Inform. Comput","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Cygan et al., 2015] Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parame- terized Algorithms. Springer, 2015.","title":"Parameterized Algorithms","authors":"Marek Cygan, V Fedor, Lukasz Fomin, Daniel Kowalik, Dániel Lokshtanov, Marcin Marx, Michal Pilipczuk, Saket Pilipczuk, Saurabh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Danna and Woodruff, 2009] Emilie Danna and David L. Woodruff. How to select a small set of diverse solutions to mixed integer programming problems. Operations Re- search Letters, 37(4):255-260, 2009.","title":"How to select a small set of diverse solutions to mixed integer programming problems","authors":"Emilie Danna, David L Woodruff","year":"2009","venue":"Operations Research Letters","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Downey and Fellows, 2013] Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Springer, 2013.","title":"Fundamentals of Parameterized Complexity","authors":"Rodney G Downey, Michael R Fellows","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Eiter et al., 2013] Thomas Eiter, Esra Erdem, Halit Erdo- gan, and Michael Fink. Finding similar/diverse solutions in answer set programming. Theory and Practice of Logic Programming, 13(3):303-359, 2013.","title":"Finding similar/diverse solutions in answer set programming","authors":"Thomas Eiter, Esra Erdem, Halit Erdogan, Michael Fink","year":"2013","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Fomin et al., 2019] Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. Kernelization. Cam- bridge University Press, 2019.","title":"Kernelization","authors":"V Fedor, Daniel Fomin, Saket Lokshtanov, Meirav Saurabh, Zehavi","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gabor et al., 2018] Thomas Gabor, Lenz Belzner, Thomy Phan, and Kyrill Schmid. Preparing for the unexpected: Diversity improves planning resilience in evolutionary al- gorithms. In 15th ICAC, pages 131-140, 2018.","title":"Preparing for the unexpected: Diversity improves planning resilience in evolutionary algorithms","authors":"Thomas Gabor, Lenz Belzner, Thomy Phan, Kyrill Schmid","year":"2018","venue":"15th ICAC","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Galle, 1989] Per Galle. Branch & sample: A simple strategy for constraint satisfaction. BIT Numer. Math., 29(3):395- 408, 1989.","title":"Per Galle. Branch & sample: A simple strategy for constraint satisfaction","authors":"Galle","year":"1989","venue":"BIT Numer. Math","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Glover et al., 2000] Fred Glover, Arne Løkketangen, and David L. Woodruff. Scatter search to generate diverse mip solutions. In Computing Tools for Modeling, Optimization and Simulation, pages 299-317. Springer, 2000.","title":"Scatter search to generate diverse mip solutions","authors":"Glover","year":"2000","venue":"Computing Tools for Modeling, Optimization and Simulation","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Gollapudi and Sharma, 2009] Sreenivas Gollapudi and Aneesh Sharma. An axiomatic approach for result diversification. In 18th WWW, pages 381-390, 2009.","title":"Sreenivas Gollapudi and Aneesh Sharma. An axiomatic approach for result diversification","authors":"Sharma Gollapudi","year":"2009","venue":"18th WWW","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Greistorfer et al., 2008] Peter Greistorfer, Arne Løkketangen, Stefan Voß, and David L. Woodruff. Experiments concerning sequential versus simultaneous maximization of objective function and distance. Journal of Heuristics, 14(6):613-625, 2008.","title":"Experiments concerning sequential versus simultaneous maximization of objective function and distance","authors":"Peter Greistorfer, Arne Løkketangen, Stefan Voß, David L Woodruff","year":"2008","venue":"Journal of Heuristics","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Hadžić et al., 2009] Tarik Hadžić, Alan Holland, and Barry O'Sullivan. Reasoning about optimal collections of solu- tions. In 15th CP, pages 409-423. Springer, 2009.","title":"Reasoning about optimal collections of solutions","authors":"Tarik Hadžić, Alan Holland, Barry O' Sullivan","year":"2009","venue":"15th CP","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Hebrard et al., 2005] Emmanuel Hebrard, Brahim Hnich, Barry O'Sullivan, and Toby Walsh. Finding diverse and similar solutions in constraint programming. In 20th AAAI, pages 372-377, 2005.","title":"Finding diverse and similar solutions in constraint programming","authors":"Emmanuel Hebrard, Brahim Hnich, O' Barry, Toby Sullivan, Walsh","year":"2005","venue":"20th AAAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Hebrard et al., 2007] Emmanuel Hebrard, Barry O'Sullivan, and Toby Walsh. Distance constraints in constraint satisfaction. In IJCAI, pages 106-111, 2007.","title":"Distance constraints in constraint satisfaction","authors":"Emmanuel Hebrard, O' Barry, Toby Sullivan, Walsh","year":"2007","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2007/15"},{"position":25,"raw":"[Jégou et al., 2007] Philippe Jégou, Samba Ndojh Ndiaye, and Cyril Terrioux. Dynamic heuristics for backtrack search on tree-decomposition of CSPs. In 20th IJCAI, pages 112-117, 2007.","title":"Dynamic heuristics for backtrack search on tree-decomposition of CSPs","authors":"Philippe Jégou, Samba Ndojh Ndiaye, Cyril Terrioux","year":"2007","venue":"20th IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2007/16"},{"position":26,"raw":"[Kuo et al., 1993] Ching-Chung Kuo, Fred Glover, and Kr- ishna S. Dhir. Analyzing and modeling the maximum di- versity problem by zero-one programming*. Decis. Sci., 24(6):1171-1185, 1993.","title":"Analyzing and modeling the maximum diversity problem by zero-one programming","authors":"Ching-Chung Kuo, Fred Glover, Krishna S Dhir","year":"1993","venue":"Decis. Sci","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Løkketangen and Woodruff, 2005] Arne Løkketangen and David L. Woodruff. A distance function to support op- timized selection decisions. Decision Support Systems, 39(3):345-354, 2005.","title":"A distance function to support optimized selection decisions","authors":"Arne Løkketangen, David L Woodruff","year":"2005","venue":"Decision Support Systems","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Nadel, 2011] Alexander Nadel. Generating diverse solu- tions in sat. In 14th SAT, pages 287-301. Springer, 2011.","title":"Generating diverse solutions in sat","authors":"Alexander Nadel","year":"2011","venue":"14th SAT","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Petit and Trapp, 2015] Thierry Petit and Andrew C. Trapp. Finding diverse solutions of high quality to constraint op- timization problems. In 24th IJCAI, pages 260-267, 2015.","title":"Finding diverse solutions of high quality to constraint optimization problems","authors":"Thierry Petit, Andrew C Trapp","year":"2015","venue":"24th IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/43"},{"position":30,"raw":"[Petit and Trapp, 2019] Thierry Petit and Andrew C. Trapp. Enriching solutions to combinatorial problems via so- lution engineering. INFORMS Journal on Computing, 31(3):429-444, 2019.","title":"Enriching solutions to combinatorial problems via solution engineering","authors":"Thierry Petit, Andrew C Trapp","year":"2019","venue":"INFORMS Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Schittekat and Sörensen, 2009] Patrick Schittekat and Ken- neth Sörensen. OR practice -supporting 3PL decisions in the automotive industry by generating diverse solutions to a large-scale location-routing problem. Operations Re- search, 57(5):1058-1067, 2009.","title":"Patrick Schittekat and Kenneth Sörensen. OR practice -supporting 3PL decisions in the automotive industry by generating diverse solutions to a large-scale location-routing problem","authors":"Sörensen Schittekat","year":"2009","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Trapp and Konrad, 2015] Andrew C. Trapp and Renata A. Konrad. Finding diverse optima and near-optima to binary integer programs. IIE Trans., 47(11):1300-1312, 2015.","title":"Finding diverse optima and near-optima to binary integer programs","authors":"Andrew C Trapp, Renata A Konrad","year":"2015","venue":"IIE Trans","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Wineberg and Oppacher, 2003] Mark Wineberg and Franz Oppacher. The underlying similarity of diversity measures used in evolutionary computation. In GECCO '03, Part II, pages 1493-1504, 2003.","title":"The underlying similarity of diversity measures used in evolutionary computation","authors":"Oppacher Wineberg, Mark Wineberg, Franz Oppacher","year":"2003","venue":"GECCO '03","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Yang and Wang, 2018] Yongjie Yang and Jianxin Wang. Multiwinner voting with restricted admissible sets: com- plexity and strategyproofness. In 27th IJCAI, pages 576- 582, 2018.","title":"Multiwinner voting with restricted admissible sets: complexity and strategyproofness","authors":"Yang, Wang ; ] Yongjie Yang, Jianxin Wang","year":"2018","venue":"27th IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/80"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}