𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for graph approximation problems

✍ Scribed by V. P. Il’ev; S. D. Il’eva; A. A. Navrotskaya

Book ID
114994283
Publisher
Pleiades Publishing
Year
2011
Tongue
English
Weight
579 KB
Volume
5
Category
Article
ISSN
1990-4789

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