Weighted Upper Edge Cover: Complexity and Approximability

Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such "flipping" of the objective function was done for many...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of graph algorithms and applications Ročník 24; číslo 2; s. 65 - 88
Hlavní autori:	Khoshkhah, Kaveh, Khosravian Ghadikolaei, Mehdi, Monnot, Jérôme, Sikora, Florian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Brown University 01.02.2020
Predmet:	Computational Complexity Computer Science Data Structures and Algorithms Discrete Mathematics
ISSN:	1526-1719, 1526-1719
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!