Pages that link to "Item:Q2471804"
From MaRDI portal
The following pages link to On the competitive ratio for online facility location (Q2471804):
Displaying 22 items.
- The online prize-collecting facility location problem (Q324761) (← links)
- Towards the price of leasing online (Q346515) (← links)
- An online 2-dimensional clustering problem with variable sized clusters (Q402248) (← links)
- Online facility location with facility movements (Q539473) (← links)
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
- An incremental version of the \(k\)-center problem on boundary of a convex polygon (Q887897) (← links)
- Randomized priority algorithms (Q974749) (← links)
- On the on-line maintenance scheduling problem (Q1744635) (← links)
- Offline and online facility leasing (Q1799393) (← links)
- Online clustering with variable sized clusters (Q1939661) (← links)
- Online facility location with mobile facilities (Q2077377) (← links)
- Online sum-radii clustering (Q2453160) (← links)
- Strategic Online Facility Location (Q2958348) (← links)
- From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
- Serving Online Requests with Mobile Servers (Q3459911) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
- (Q5009578) (← links)
- (Q5009599) (← links)
- Supply Chain Management with Online Customer Selection (Q5740223) (← links)
- Online facility assignment (Q5919330) (← links)
- On the Facility Location Problem in Online and Dynamic Models. (Q6084398) (← links)
- Any-order online interval selection (Q6574946) (← links)
