BOOK-CHAPTER
Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract
Year: 2004 Lecture notes in computer science Pages: 348-359 Publisher: Springer Science+Business Media
Keywords:
Hyperplane Semidefinite programming Combinatorics Relaxation (psychology) Approximation algorithm Mathematics Graph partition Maximum cut Vertex cover Vertex (graph theory) Heuristic Algorithm Linear programming Mathematical optimization Graph Computer science
Metrics
3
Cited By
0.54
FWCI (Field Weighted Citation Impact)
18
Refs
0.63
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
VLSI and FPGA Design Techniques
Physical Sciences → Engineering → Electrical and Electronic Engineering
Related Documents
JOURNAL ARTICLE
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Journal: Journal of Combinatorial Optimization Year: 2005 Vol: 10 (2)Pages: 133-167
BOOK-CHAPTER
Approximation Algorithms for Some Graph Partitioning Problems
WORLD SCIENTIFIC eBooks Year: 2004 Pages: 21-31
JOURNAL ARTICLE
Approximation Algorithms for Some Graph Partitioning Problems
Journal: Journal of Graph Algorithms and Applications Year: 2000 Vol: 4 (2)Pages: 1-11
JOURNAL ARTICLE
Improved Approximation Algorithms for Balanced Partitioning Problems
Journal: Leibniz-Zentrum für Informatik (Schloss Dagstuhl) Year: 2016
JOURNAL ARTICLE
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
Journal: Journal of Algorithms Year: 2001 Vol: 41 (2)Pages: 174-211