Maximum balanced subgraph problem parameterized above lower bound.
Robert CrowstonGregory Z. GutinMark JonesGabriele MuciacciaPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- lower bound
- upper bound
- np hard
- branch and bound algorithm
- branch and bound
- worst case
- optimal solution
- upper and lower bounds
- data sets
- objective function
- lower and upper bounds
- graph mining
- lower bounding
- search space
- lagrangian relaxation
- graph databases
- vc dimension
- competitive ratio
- sufficiently accurate
- maximum number
- processing times
- integer programming
- approximation algorithms
- single machine
- linear programming