A polylogarithmic approximation of the minimum bisection
From MaRDI portal
Recommendations
- A Polylogarithmic Approximation of the Minimum Bisection
- scientific article; zbMATH DE number 1929926
- Approximating the minimum bisection size (extended abstract)
- Approximation of satisfactory bisection problems
- Minimum bisection is fixed parameter tractable
- Minimum bisection is fixed-parameter tractable
- A 2-approximation for the maximum satisfying bisection problem
- A polynomial-time bicriteria approximation scheme for planar bisection
- Asymptotic near optimality of the bisection method
- Bisections above Tight Lower Bounds
Cited in
(36)- scientific article; zbMATH DE number 1929926 (Why is no real title available?)
- Competitive clustering of stochastic communication patterns on a ring
- On the minimum bisection of random 3-regular graphs
- A polynomial-time bicriteria approximation scheme for planar bisection
- Exact recovery in the Ising blockmodel
- On the minimum edge bisection of graph
- On the complexity of finding balanced oneway cuts
- A Polylogarithmic Approximation of the Minimum Bisection
- scientific article; zbMATH DE number 7525479 (Why is no real title available?)
- Distributed balanced partitioning via linear embedding
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem
- Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy
- New abilities and limitations of spectral graph bisection
- Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity
- Solving the minimum bisection problem using a biologically inspired computational model
- Vertex Bisection is Hard, too
- A semidefinite programming approach to the hypergraph minimum bisection problem
- Approximating spanning tree congestion on graphs with polylog degree
- Linear kernels for separating a graph into components of bounded size
- Approximating the minimum bisection size (extended abstract)
- Multicommodity flow approximation used for exact graph partitioning
- Complexity of the bisection method
- Balanced cut approximation in random geometric graphs
- Upper bounds on the bisection width of 3- and 4-regular graphs
- Bisection of bounded treewidth graphs by convolutions
- Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking
- Bisections above Tight Lower Bounds
- An efficient algorithm for graph bisection of triangularizations
- Graph clustering
- Brief announcement: Bounded-degree cut is fixed-parameter tractable
- A subquadratic bound for online bisection
- Optimal padded decomposition for bounded treewidth graphs
- 3D geo-graphs: efficient flip verification for the spherical zoning problem
- Dynamic balanced graph partitioning
- Minimum Bisection Is Fixed-Parameter Tractable
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT
This page was built for publication: A polylogarithmic approximation of the minimum bisection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784494)
