Pages that link to "Item:Q5700571"

The following pages link to Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs (Q5700571):

Displaying 16 items.

• On minimum bisection and related partition problems in graphs with bounded tree width (Q322301) (← links)
• Approximating minimum \(k\)-section in trees with linear diameter (Q324723) (← links)
• Local search: is brute-force avoidable? (Q439931) (← links)
• An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
• A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
• MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483) (← links)
• An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
• A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
• A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399) (← links)
• Balanced polychromatic 2-coloring of triangulations (Q2062902) (← links)
• Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
• Minimum bisection is NP-hard on unit disk graphs (Q2407090) (← links)
• Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
• Approximation Algorithms for Geometric Intersection Graphs (Q3508563) (← links)
• Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
• (Q5092387) (← links)