Geometric bipartite matching based exact algorithms for server problems
From MaRDI portal
Cites work
- \(k\)-server via multiscale entropic regularization
- A fast implementation of the optimal off-line algorithm for solving the k-server problem
- A fast work function algorithm for solving the k-server problem
- A new approach to solve the k-server problem based on network flows and flow cost reduction
- A robust and optimal online algorithm for minimum metric bipartite matching
- A scalable work function algorithm for the \(k\)-server problem
- A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
- Algorithms for the transportation problem in geometric settings
- An input sensitive online algorithm for the metric bipartite matching problem
- An Optimal On-Line Algorithm for K Servers on Trees
- Applications of a Planar Separator Theorem
- Competitive algorithms for server problems
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Faster scaling algorithms for general graph matching problems
- Faster Scaling Algorithms for Network Problems
- Fusible HSTs and the randomized k-server conjecture
- Geometry Helps in Matching
- scientific article; zbMATH DE number 7236471 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Maximum flow and minimum-cost flow in almost-linear time
- New Ressults on Server Problems
- On the k -server conjecture
- The \(k\)-server problem
This page was built for publication: Geometric bipartite matching based exact algorithms for server problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312720)
