scientific article; zbMATH DE number 1929926
From MaRDI portal
Publication:4708558
Recommendations
Cited in
(20)- Lepp-bisection algorithms, applications and mathematical properties
- Minimum transversals of maximum matchings as approximate solutions to the bisection problem
- On minimum balanced bipartitions of triangle-free graphs
- Two new integer linear programming formulations for the vertex bisection problem
- Minimum bisection is NP-hard on unit disk graphs
- A polylogarithmic approximation of the minimum bisection
- Maximum balanced 3-partitions of graphs
- Generating all patterns of graph partitions within a disparity bound
- Vertex Bisection is Hard, too
- Approximating the minimum bisection size (extended abstract)
- Coloring Graphs with Minimal Edge Load
- scientific article; zbMATH DE number 5734227 (Why is no real title available?)
- Optimal cuts and partitions in tree metrics in polynomial time
- Upper bounds on minimum balanced bipartitions
- scientific article; zbMATH DE number 2086657 (Why is no real title available?)
- scientific article; zbMATH DE number 5237020 (Why is no real title available?)
- A Polylogarithmic Approximation of the Minimum Bisection
- Some heuristics for the binary paint shop problem and their expected number of colour changes
- Solving the minimum bisection problem using a biologically inspired computational model
- Approximation algorithms for the Bipartite Multicut problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708558)
