✦ LIBER ✦

Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover

✍ Scribed by Peter Damaschke; Leonid Molokov

Book ID: 117984021
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 224 KB
Volume: 452
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.05.031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Approximation Algorithms for th

Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs

✍ Halperin, Eran 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 198 KB

A branch-and-cut algorithm for solving g

A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs

✍ Suhl, Uwe H.; Hilbert, Heinrich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB 👁 2 views

Given is an undirected graph with positive or negative edge weights which represent a profit if an investment such as installing a gas pipe takes place in a given time period. A certain part of the graph may already be piped in previous periods. The task is to extend the piped subgraph in the most p