Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection
Journal of Global Optimization
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On cutting a few vertices from a graph
Discrete Applied Mathematics
Bounds on the max and min bisection of random cubic and random 4-regular graphs
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Approximation schemes for Metric Bisection and partitioning
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
New theoretical results on quadratic placement
Integration, the VLSI Journal
Bounds on the bisection width for random d -regular graphs
Theoretical Computer Science
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
A Heuristic for Fair Correlation-Aware Resource Placement
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Triangle listing in massive networks and its applications
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Triangle listing in massive networks
ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on the Best of SIGKDD 2011
Balanced label propagation for partitioning massive graphs
Proceedings of the sixth ACM international conference on Web search and data mining
| Hi-index | 0.01 |
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. Finding the bisection of minimum cost is NP-hard. We present an algorithm that finds a bisection whose cost is within ratio of O(log/sup 2/ n) from the optimal. For graphs excluding any fixed graph as a minor (e.g. planar graphs) we obtain an improved approximation ratio of O(log n). The previously known approximation ratio for bisection was roughly /spl radic/n.