Mathematical Programming: Series A and B
The Minimum Satisfiability Problem
SIAM Journal on Discrete Mathematics
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximating the minimum bisection size (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Polynomial time approximation of dense weighted instances of MAX-CUT
Random Structures & Algorithms
A note on approximating Max-Bisection on regular graphs
Information Processing Letters
A randomized approximation scheme for metric MAX-CUT
Journal of Computer and System Sciences
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improved Non-approximability Results for Vertex Cover with Density Constraints
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
A Polynomial Time Approximation Scheme for Dense MIN 2SAT
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
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
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A polylogarithmic approximation of the minimum bisection
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Approximating Dense Cases of Covering Problems
Approximating Dense Cases of Covering Problems
A Polynomial Time Approximation Scheme for Metric MIN-BISECTION
A Polynomial Time Approximation Scheme for Metric MIN-BISECTION
Approximation algorithms for NP-complete problems on planar graphs
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Simulated annealing for graph bisection
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Approximation schemes for Metric Bisection and partitioning
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A spectral heuristic for bisecting random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Throughput-driven synthesis of embedded software for pipelined execution on multicore architectures
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.00 |
We survey some recent results on the complexity of computing approximate solutions for instances of the Minimum Bisection problem and formulate some very intriguing and still open questions about the approximability status of that problem.