The Curse of Connectivity: t-Total Vertex (Edge) Cover

DOI10.1007/978-3-642-14031-0_6zbMath1286.68228OpenAlexW4241472005WikidataQ60488653 ScholiaQ60488653MaRDI QIDQ3578300

Geevarghese Philip, Henning Fernau, Saket Saurabh, Fedor V. Fomin

Publication date: 20 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items

On approximating (connected) 2-edge dominating set by a tree, On the parameterized complexity of vertex cover and edge cover with connectivity constraints, Parameterized measure \& conquer for problems with no small kernels, On Approximating (Connected) 2-Edge Dominating Set by a Tree, Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers