Bounds and algorithms for limited packings in graphs.
Andrei GagarinVadim E. ZverovichPublished in: CoRR (2014)
Keyphrases
- lower bound
- upper bound
- upper and lower bounds
- worst case
- randomized algorithms
- np hard
- objective function
- constant factor
- learning algorithm
- average case
- data structure
- graph theory
- computational complexity
- computationally efficient
- benchmark datasets
- significant improvement
- computational cost
- optimization problems
- orders of magnitude
- bipartite graph
- machine learning