Max-Cut Above Spanning Tree is Fixed-Parameter Tractable.
Jayakrishnan MadathilSaket SaurabhMeirav ZehaviPublished in: CSR (2018)
Keyphrases
- max cut
- spanning tree
- fixed parameter tractable
- np hard
- minimum cost
- np complete
- np complete problems
- approximation algorithms
- minimum weight
- minimum spanning tree
- scheduling problem
- lower bound
- planar graphs
- special case
- computational problems
- branch and bound algorithm
- worst case
- optimal solution
- integer programming
- knapsack problem
- constraint satisfaction problems
- graph model
- decision problems
- global constraints
- undirected graph
- conjunctive queries
- edge weights
- computational complexity