Pages that link to "Item:Q5383995"
From MaRDI portal
The following pages link to Maintaining Assignments Online: Matching, Scheduling, and Flows (Q5383995):
Displayed 12 items.
- Serve or skip: the power of rejection in online bottleneck matching (Q346521) (← links)
- Online maximum matching with recourse (Q830934) (← links)
- Shortest augmenting paths for online matchings on trees (Q1743118) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- Shortest Augmenting Paths for Online Matchings on Trees (Q2788991) (← links)
- Simultaneously load balancing for every p-norm, with reassignments (Q4638106) (← links)
- Online Maximum Matching with Recourse (Q5005104) (← links)
- (Q6062163) (← links)
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching (Q6084396) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Online load balancing on uniform machines with limited migration (Q6106523) (← links)
- Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem (Q6202754) (← links)