Skip to main navigation
Skip to search
Skip to main content
Technical University of Munich Home
Help & FAQ
English
Deutsch
Home
Profiles
Research units
Projects
Research output
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Balanced graph partitioning
Konstantin Andreev,
Harald Räcke
Carnegie Mellon University
Carnegie Mellon University
Research output
:
Contribution to journal
›
Article
›
peer-review
268
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Balanced graph partitioning'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Ratio
100%
Balanced Graph Partitioning
100%
Polynomial Time
33%
Polynomial-time Approximation Algorithm
33%
P-NP
33%
Approximation Algorithms
33%
Approximation Guarantee
33%
Finite Approximation
33%
Bicriteria Approximation Algorithms
33%
Bicriteria Approximation
33%
Minimum Bisection
33%
Mathematics
Bicriteria
100%
Polynomial Time
100%
Graph Partition
100%
Edge
50%
Precise Statement
50%
Main Result
50%
Computer Science
Approximation Algorithms
100%
Graph Partition
100%
Approximation Ratio
100%
Polynomial Time
66%
Approximation (Algorithm)
33%