✦ LIBER ✦

Better lower and upper bounds for the minimum rainbow subgraph problem

✍ Scribed by Popa, Alexandru

Book ID: 124117647
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 454 KB
Volume: 543
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.05.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved approximation bounds for the mi

Improved approximation bounds for the minimum rainbow subgraph problem

✍ Ján Katrenič; Ingo Schiermeyer 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 145 KB

Algorithmic approaches for the minimum r

Algorithmic approaches for the minimum rainbow subgraph problem

✍ Maria Koch; Stephan Matos Camacho; Ingo Schiermeyer 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 177 KB

Lower and upper bounds for the degree-co

Lower and upper bounds for the degree-constrained minimum spanning tree problem

✍ Alexandre Salles da Cunha; Abilio Lucena 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

Upper and lower bounding procedures for

Upper and lower bounding procedures for minimum rooted k-subtree problem

✍ Seiji Kataoka; Norio Araki; Takeo Yamada 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 429 KB

Upper and lower bounds for a pattern bom

Upper and lower bounds for a pattern bombing problem

✍ Alan R. Washburn 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 403 KB 👁 1 views

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