✦ LIBER ✦

Fast Approximate Graph Partitioning Algorithms

✍ Scribed by Even, Guy; Naor, Joseph (Seffi); Rao, Satish; Schieber, Baruch

Book ID: 118177500
Publisher: Society for Industrial and Applied Mathematics
Year: 1999
Tongue: English
Weight: 498 KB
Volume: 28
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539796308217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Approximation Algorithms for Ma

Improved Approximation Algorithms for Maximum Graph Partitioning Problems

✍ Gerold Jäger; Anand Srivastav 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 289 KB

Approximate algorithms for partitioning

Approximate algorithms for partitioning problems

✍ Mohammad Ashraf Iqbal 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 999 KB

Algorithms for partitioning a graph

✍ Taehoon Park; Chae Y. Lee 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 606 KB

A class of bounded approximation algorit

A class of bounded approximation algorithms for graph partitioning

✍ Thomas A. Feo; Mallek Khellaf 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 847 KB

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 graph appro

Approximation algorithms for graph approximation problems

✍ V. P. Il’ev; S. D. Il’eva; A. A. Navrotskaya 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 579 KB