𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved Approximation Algorithms for Maximum Graph Partitioning Problems

✍ Scribed by Gerold Jäger; Anand Srivastav

Publisher
Springer US
Year
2005
Tongue
English
Weight
289 KB
Volume
10
Category
Article
ISSN
1382-6905

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

Improved Approximation Algorithms for Un
Improved Approximation Algorithms for Uniform Connectivity Problems
✍ Samir Khuller; Balaji Raghavachari 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 174 KB

The problem of finding minimum-weight spanning subgraphs with a given connectivity requirement is considered. The problem is NP-hard when the connectivity requirement is greater than one. Polynomial time approximation algorithms for various weighted and unweighted connectivity problems are given. Th