DeepAI AI Chat
Log In Sign Up

Maximum Cut Parameterized by Crossing Number

by   Markus Chimani, et al.

Given an edge-weighted graph G on n nodes, the NP-hard Max-Cut problem asks for a node bipartition such that the sum of edge weights joining the different partitions is maximized. We propose a fixed-parameter tractable algorithm parameterized by the number k of crossings in a given drawing of G. Our algorithm achieves a running time of O(2^k p(n + k)), where p is the polynomial running time for planar Max-Cut. The only previously known similar algorithm [8] is restricted to 1-planar graphs (i.e., at most one crossing per edge) and its dependency on k is of order 3^k . A direct consequence of our result is that Max-Cut is fixed-parameter tractable w.r.t. the crossing number, even without a given drawing.


page 1

page 2

page 3

page 4


An FPT Algorithm for Max-Cut Parameterized by Crossing Number

The Max-Cut problem is known to be NP-hard on general graphs, while it c...

Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs

We propose two fixed-parameter tractable algorithms for the weighted Max...

On the computational tractability of a geographic clustering problem arising in redistricting

Redistricting is the problem of dividing a state into a number k of regi...

Fixed Parameter Approximation Scheme for Min-max k-cut

We consider the graph k-partitioning problem under the min-max objective...

Parameterized Algorithms for Zero Extension and Metric Labelling Problems

We consider the problems ZERO EXTENSION and METRIC LABELLING under the p...

A Bayesian Approach to Tackling Hard Computational Problems

We are developing a general framework for using learned Bayesian models ...