Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10422371" target="_blank" >RIV/00216208:11320/20:10422371 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.24963/ijcai.2020/156" target="_blank" >https://doi.org/10.24963/ijcai.2020/156</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.24963/ijcai.2020/156" target="_blank" >10.24963/ijcai.2020/156</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020

ISBN

978-0-9992411-6-5

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

1119-1125

Název nakladatele

International Joint Conferences on Artificial Intelligence

Místo vydání

neuveden

Místo konání akce

Yokohama, Japan

Datum konání akce

7. 1. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—