Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs.
Yoshiko WakabayashiFrédéric ChataignerLiliane Benning SalgadoPublished in: Discret. Math. Theor. Comput. Sci. (2007)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- approximation guarantees
- connected graphs
- error bounds
- graph representation
- graph theoretic
- approximation ratio
- approximation methods
- clustering algorithm
- directed graph
- series parallel
- graph matching
- graph theory
- complex structures
- learning algorithm
- queueing networks
- graph clustering
- approximation error
- graph mining
- neighborhood graph
- graph structures
- graph partitioning
- approximation schemes
- error tolerance
- max cut
- weighted graph