𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved approximation bounds for the minimum rainbow subgraph problem

✍ Scribed by Ján Katrenič; Ingo Schiermeyer

Book ID
108154734
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
145 KB
Volume
111
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 linear time 53-approximation for the m
A linear time 53-approximation for the minimum strongly-connected spanning subgraph problem
✍ Liang Zhao; Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 134 KB

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 con

Tight Bounds for the Maximum Acyclic Sub
Tight Bounds for the Maximum Acyclic Subgraph Problem
✍ Bonnie Berger; Peter W Shor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Given a directed graph G s V, A , the maximum acyclic subgraph problem is to Ž . find a maximum cardinality subset AЈ of the arcs such that GЈ s V, AЈ is acyclic. In this paper, we present polynomial-time and RNC algorithms which, when given Ž any graph G without two-cycles, find an acyclic subgraph