O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities

We consider capacitated vertex cover with hard capacity constraints (VC-HC) on hypergraphs. In this problem we are given a hypergraph G = ( V , E ) with a maximum edge size f . Each edge is associated with a demand and each vertex is associated with a weight (cost), a capacity, and an available mult...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 81; číslo 5; s. 1800 - 1817
Hlavní autoři:	Kao, Mong-Jen, Tu, Hai-Lun, Lee, D. T.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 15.05.2019 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Apexes Approximation Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Mathematical analysis Mathematics of Computing Minimum weight Theory of Computation Hard capacities Capacitated covering Bi-criteria approximation
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!