Diverse collections in matroids and graphs

We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems. The input to the Weighted Diverse Bases problem consists of a matroid M , a weight function ω : E ( M ) → N , and integers k ≥ 1 , d ≥ 1 . The task is to decide if there is a...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 204; číslo 1-2; s. 415 - 447
Hlavní autori:	Fomin, Fedor V., Golovach, Petr A., Panolan, Fahad, Philip, Geevarghese, Saurabh, Saket
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2024 Springer
Predmet:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical 68Q25 05B35 68W40 Diversity of solutions 05C85 68Q27 Matroids Graphs 05C70 Parameterized complexity
ISSN:	0025-5610, 1436-4646
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!