The Online Median Problem
From MaRDI portal
Recommendations
Cited in
(51)- A cost-sharing method for an economic lot-sizing game
- The reverse greedy algorithm for the metric k-median problem
- A \(k\)-median based online algorithm for the stochastic \(k\)-server problem
- Relaxed triangle inequality ratio of the Sørensen-Dice and Tversky indexes
- Graph summarization with quality guarantees
- Towards flexible demands in online leasing problems
- An approximation algorithm for the Euclidean incremental median problem
- Computing knapsack solutions with cardinality robustness
- Near-optimal clustering in the \(k\)-machine model
- General bounds for incremental maximization
- A cost-sharing scheme for the \(k\)-level facility location game with penalties
- Reallocating multiple facilities on the line
- Soft-capacitated facility location game
- Cache me if you can: capacitated selfish replication games in networks
- A cross-monotonic cost-sharing scheme for the concave facility location game
- The \(k\)-level facility location game
- On the competitive ratio for online facility location
- Incremental medians via online bidding
- Incremental algorithms for facility location and \(k\)-median
- Online maintenance of k-medians and k-covers on a line
- Semimetric properties of Sørensen-Dice and Tversky indexes
- Clairvoyant mechanisms for online auctions
- Incremental network design with shortest paths
- An improved competitive algorithm for one-dimensional incremental median problem
- An approximate solution algorithm for the one-dimensional online median problem
- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
- Online facility location against a \(t\)-bounded adversary
- Efficient approximations for the online dispersion problem
- Quick k-Median, k-Center, and Facility Location for Sparse Graphs
- A cost-sharing method for an uncapacitated facility location game with penalties
- Online facility location with deletions
- Large-scale distributed algorithms for facility location with outliers
- A distributed O(1)-approximation algorithm for the uniform facility location problem
- Algorithm Theory - SWAT 2004
- Better Bounds for Incremental Medians
- Obtaining online approximation algorithms for facility dispersion from offline algorithms
- Computing and Combinatorics
- Robust independence systems
- Approximation algorithms for hierarchical location problems
- Incremental facility location problem and its competitive algorithms
- Better bounds for incremental medians
- Fully-scalable MPC algorithms for clustering in high dimension
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- A simple and deterministic competitive algorithm for online facility location
- Incremental maximization for a broad class of objectives
- Sub-logarithmic distributed algorithms for metric facility location
- An incremental version of the \(k\)-center problem on boundary of a convex polygon
- A 16-competitive algorithm for hierarchical median problem
- Non-cooperative facility location and covering games
- Kinetic facility location
- Randomized priority algorithms
This page was built for publication: The Online Median Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4706233)
