𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear time 53-approximation for the minimum strongly-connected spanning subgraph problem

✍ Scribed by Liang Zhao; Hiroshi Nagamochi; Toshihide Ibaraki

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
134 KB
Volume
86
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

A linear time 5 3 -approximation algorithm is presented for the NP-hard problem of finding a minimum strongly-connected spanning subgraph. It is based on cycle contraction that was first introduced by Khuller, Raghavachari and Young [SIAM J. Comput. 24 (1995) 859-872]. We improve their result by contracting special cycles and utilizing a more efficient data structure.

πŸ“œ SIMILAR VOLUMES

A Better Approximation Ratio for the Min
A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
✍ Cristina G Fernandes πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 213 KB

Consider the minimum size k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, find a k-edge-connected spanning subgraph of G with the minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the first algo

A logarithmic approximation algorithm fo
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
✍ Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 123 KB

Motivated by the problem of supporting energy-efficient broadcasting in ad hoc wireless networks, we study the Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. We present the first logarithmic approximation algorithm for the problem which uses an interesting reduction to Node-Weighted