Max-Cut and Max-Bisection are NP-hard on unit disk graphs
Abstract
We prove that the Max-Cut and Max-Bisection problems are NP-hard on unit disk graphs. We also show that λ-precision graphs are planar for λ > 1 / 2$.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.