✦ LIBER ✦

Approximation Algorithms for Graph Augmentation

✍ Scribed by S. Khuller; R. Thurimella

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 500 KB
Volume: 14
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1993.1010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for Maximizatio

Approximation Algorithms for Maximization Problems Arising in Graph Partitioning

✍ Uriel Feige; Michael Langberg 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Given a graph G = V E , a weight function w E → R + , and a parameter k, we consider the problem of finding a subset U ⊆ V of size k that maximizes: Max-Vertex Cover k the weight of edges incident with vertices in U, Max-Dense Subgraph k the weight of edges in the subgraph induced by U, Max-Cut k th

Approximation Algorithms for Independent

Approximation Algorithms for Independent Sets in Map Graphs

✍ Zhi-Zhong Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 172 KB

This paper presents polynomial-time approximation algorithms for the problem of computing a maximum independent set in a given map graph G with or without weights on its vertices. If G is given together with a map, then a ratio of 1 + δ can be achieved by a quadratic-time algorithm for any given con

NOTE Improved Approximation Algorithms f

NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems

✍ Michal Penn; Haya Shasha-Krupnik 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 126 KB

The problem of finding a minimum augmenting edge-set to make a graph k-vertex connected is considered. This problem is denoted as the minimum k-augmentation problem. For weighted graphs, the minimum k-augmentation problem is NP-complete. Our main result is an approximation algorithm with a performan

Approximation Algorithms for Dispersion

Approximation Algorithms for Dispersion Problems

✍ Barun Chandra; Magnús M Halldórsson 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Approximation algorithms for covering a

Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight

✍ Shlomo Moran; Ilan Newman; Yaron Wolfstahl 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 464 KB

Approximation Algorithms for the Achroma

Approximation Algorithms for the Achromatic Number

✍ Amitabh Chaudhary; Sundar Vishwanathan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 108 KB

The achromatic number for a graph G = V E is the largest integer m such that there is a partition of V into disjoint independent sets V 1 V m such that for each pair of distinct sets V i , V j , V i ∪ V j is not an independent set in G. Yannakakis and Gavril (1980, SIAM J. Appl. Math. 38, 364-372) p