Weighted upper edge cover: complexity and approximability
From MaRDI portal
Publication:2327526
DOI10.1007/978-3-030-10564-8_19zbMath1420.68093arXiv1811.02599OpenAlexW2963310954MaRDI QIDQ2327526
Florian Sikora, Jérôme Monnot, Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei
Publication date: 15 October 2019
Full work available at URL: https://arxiv.org/abs/1811.02599
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Computing the largest bond and the maximum connected cut of a graph ⋮ Algorithmic aspects of upper edge domination ⋮ Weighted Upper Edge Cover: Complexity and Approximability