Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles.
Fedor V. FominDaniel LokshtanovNeeldhara MisraGeevarghese PhilipSaket SaurabhPublished in: J. Graph Theory (2013)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- simulated annealing
- worst case
- tight bounds
- lower and upper bounds
- objective function
- sample complexity
- error probability
- linear functions
- branch and bound algorithm
- branch and bound
- tight upper and lower bounds
- upper bounding
- computational complexity
- pairwise
- packing problem
- multi class
- stock market
- efficient learning
- financial time series
- special case
- permutation flowshop
- linear programming
- sequential quadratic programming
- genetic algorithm
- strip packing