Approximation Algorithms for Maximization Problems Arising in Graph Partitioning

@article{Feige2001ApproximationAF,
  title={Approximation Algorithms for Maximization Problems Arising in Graph Partitioning},
  author={Uriel Feige and Michael Langberg},
  journal={J. Algorithms},
  year={2001},
  volume={41},
  pages={174-211}
}
Given a graph G = (V;E), a weight function w : E ! R+ and a parameter k we examine a family of maximization problems arising naturally when considering a subset U V of size exactly k. Speci cally we consider the problem of nding a subset U V of size k that maximizes : Max-k-Vertex Cover : the weight of edges incident with vertices in U . Max-k-Dense Subgraph : the weight of edges in the subgraph induced by U . Max-k-Cut : the weight of edges cut by the partition (U; V nU). Max-k-Not Cut : the… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 87 extracted citations

Approximation Algorithms for Combinatorial Optimization

Lecture Notes in Computer Science • 2002
View 12 Excerpts
Highly Influenced

On Dense Subgraphs in Signed Network Streams

2016 IEEE 16th International Conference on Data Mining (ICDM) • 2016
View 4 Excerpts
Highly Influenced

A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph

2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming • 2011
View 2 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Matrix computation

G. H. Golub, C. F. Van Loan
1983

Similar Papers

Loading similar papers…