Pages that link to "Item:Q5896918"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5896918):
Displaying 12 items.
- Station assignment with reallocation (Q666668) (← links)
- On the max coloring problem (Q690449) (← links)
- A randomized algorithm for online unit clustering (Q839627) (← links)
- An improved algorithm for online coloring of intervals with bandwidth (Q860808) (← links)
- Online interval coloring with packing constraints (Q954991) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- A new lower bound for the on-line coloring of intervals with bandwidth (Q1686078) (← links)
- Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
- (Q5136269) (← links)
- On the Max Coloring Problem (Q5443379) (← links)
- Complexity and online algorithms for minimum skyline coloring of intervals (Q5919565) (← links)
- Improved lower bound on the on-line chain partitioning of semi-orders with representation (Q6056742) (← links)
