Online facility assignment
From MaRDI portal
Recommendations
Cites work
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- A lower bound for two-server balancing algorithms
- A randomized O(^2k)-competitive algorithm for metric bipartite matching
- An Optimal On-Line Algorithm for K Servers on Trees
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation and Online Algorithms
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Competitive algorithms for server problems
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 432776 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- scientific article; zbMATH DE number 3069634 (Why is no real title available?)
- On r-gatherings on the line
- On min-max \(r\)-gatherings
- On the competitive ratio for online facility location
- On the competitive ratio of the work function algorithm for the k-server problem
- On the history of the transportation and maximum flow problems
- On-line algorithms for weighted bipartite matching and stable marriages
- Online Weighted Matching
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- The 2-evader problem
- The 3-server problem in the plane.
- The stepping stone method of explaining linear programming calculations in transportation problems
Cited in
(19)- Online facility location with mobile facilities
- Facility reallocation on the line
- The fast algorithm for online \(k\)-server problem on trees
- Online bottleneck semi-matching
- Reallocating multiple facilities on the line
- Strategic online facility location
- Online facility location with deletions
- Competitive analysis for two variants of online metric matching problem
- Online facility location with facility movements
- Approximation and Online Algorithms
- Online facility assignment
- Two online algorithms for the ambulance systems
- Online bottleneck matching on a line
- Online facility assignment for general layout of servers on a line
- Time efficient implementation for online k-server problem on trees
- Capacity-insensitive algorithms for online facility assignment problems on a line
- \textsc{Permutation} for online metric matching with \(m\) distinct servers
- A primal-dual algorithm for online non-uniform facility location
- Clever or smart: strategies for the online target date assignment problem
This page was built for publication: Online facility assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919330)
