Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds.
Anh TranEdward TalmagePublished in: PODC (2023)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- objective function
- lower and upper bounds
- worst case
- np hard
- upper and lower bounds
- lower bounding
- special case
- hazard rate
- optimal solution
- sample complexity
- queue length
- vc dimension
- queueing theory
- optimal cost
- loss probability
- improved algorithm
- set of randomly generated instances
- state dependent
- data sets
- linear programming
- search algorithm
- neural network