Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.
Klaus JansenMarek KarpinskiAndrzej LingasEike SeidelPublished in: SIAM J. Comput. (2005)
Keyphrases
- approximation schemes
- approximation algorithms
- planar graphs
- undirected graph
- special case
- graph theoretical
- np hard
- geometric shapes
- graph isomorphism
- worst case
- polynomial time complexity
- vertex set
- graph theory
- bounded treewidth
- reeb graph
- numerical methods
- weighted graph
- directed graph
- upper bound
- error metrics
- multiresolution
- bin packing
- high order
- search algorithm
- multiscale