𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating Node-Connectivity Augmentation Problems

✍ Scribed by Zeev Nutov

Publisher
Springer
Year
2011
Tongue
English
Weight
498 KB
Volume
63
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximating Node-Deletion Problems for
Approximating Node-Deletion Problems for Matroidal Properties
✍ Toshihiro Fujito πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 134 KB

The paper is concerned with the polynomial time approximability of node-deletion problems for hereditary properties. It is observed that, when such a property derives a matroid on any graph, the problem can be formulated as a matroid set cover optimization problem, and this leads us naturally to con

Fast Algorithms for k-Shredders and k-No
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
✍ Joseph Cheriyan; Ramakrishna Thurimella πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 321 KB

A k-separator k-shredder of a k-node connected undirected graph is a set of k Ε½ . nodes whose removal results in two or more three or more connected components. Let n denote the number of nodes. Solving an open question, we show that the problem of counting the number of k-separators is ΰ »P-complete.