The following pages link to Online Set Packing (Q3143291):
Displaying 15 items.
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- Streaming algorithms for independent sets in sparse hypergraphs (Q329293) (← links)
- Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
- Scheduling multipacket frames with frame deadlines (Q1702660) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- Competitive router scheduling with structured data (Q2440162) (← links)
- A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
- (Q2969609) (← links)
- Distributed Testing of Distance-k Colorings (Q5100965) (← links)
- Online set packing and competitive scheduling of multi-part tasks (Q5176219) (← links)
- Online Mixed Packing and Covering (Q5741714) (← links)
- Approximation and Online Algorithms (Q5898475) (← links)
- Overflow management with self-eliminations (Q5918714) (← links)
- Simple and local independent set approximation (Q5919021) (← links)
- Overflow management with self-eliminations (Q5925615) (← links)