Balanced connected partitions of graphs: approximation, parameterization and lower bounds.
Phablo F. S. MouraMatheus Jun OtaYoshiko WakabayashiPublished in: J. Comb. Optim. (2023)
Keyphrases
- lower bound
- approximation guarantees
- upper bound
- np hard
- approximation algorithms
- polynomial approximation
- constant factor
- branch and bound algorithm
- greedy algorithm
- objective function
- linear programming relaxation
- branch and bound
- bayes error rate
- integrality gap
- directed graph
- connected graphs
- graph theory
- closed form
- worst case
- lower and upper bounds
- neighborhood graph
- min sum
- approximation ratio
- optimal solution
- graph representation
- error bounds
- random graphs
- adjacency matrix
- randomized algorithm
- graph model
- weighted graph
- graph matching
- approximation error
- upper and lower bounds
- vertex set
- graph structure
- knapsack problem