The following pages link to The Online Median Problem (Q4706233):
Displaying 39 items.
- Incremental network design with shortest paths (Q296857) (← links)
- A cost-sharing method for an uncapacitated facility location game with penalties (Q488891) (← links)
- A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
- Incremental facility location problem and its competitive algorithms (Q604759) (← links)
- Better bounds for incremental medians (Q627114) (← links)
- A simple and deterministic competitive algorithm for online facility location (Q703850) (← links)
- Sub-logarithmic distributed algorithms for metric facility location (Q748120) (← links)
- An incremental version of the \(k\)-center problem on boundary of a convex polygon (Q887897) (← links)
- A 16-competitive algorithm for hierarchical median problem (Q893690) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- Kinetic facility location (Q970606) (← links)
- Randomized priority algorithms (Q974749) (← links)
- A cost-sharing method for an economic lot-sizing game (Q1015308) (← links)
- The reverse greedy algorithm for the metric k-median problem (Q1045901) (← links)
- Relaxed triangle inequality ratio of the Sørensen-Dice and Tversky indexes (Q1705776) (← links)
- Graph summarization with quality guarantees (Q1741300) (← links)
- Towards flexible demands in online leasing problems (Q1750358) (← links)
- An approximation algorithm for the Euclidean incremental median problem (Q1751197) (← links)
- Computing knapsack solutions with cardinality robustness (Q1926647) (← links)
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- A cost-sharing scheme for the \(k\)-level facility location game with penalties (Q2136517) (← links)
- Soft-capacitated facility location game (Q2267278) (← links)
- Cache me if you can: capacitated selfish replication games in networks (Q2300628) (← links)
- A cross-monotonic cost-sharing scheme for the concave facility location game (Q2393059) (← links)
- The \(k\)-level facility location game (Q2466591) (← links)
- On the competitive ratio for online facility location (Q2471804) (← links)
- Incremental medians via online bidding (Q2482726) (← links)
- Incremental algorithms for facility location and \(k\)-median (Q2503354) (← links)
- Semimetric Properties of Sørensen-Dice and Tversky Indexes (Q2803837) (← links)
- Clairvoyant Mechanisms for Online Auctions (Q2817844) (← links)
- An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem (Q3004653) (← links)
- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection (Q3541120) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
- (Q5009578) (← links)
- (Q5091075) (← links)
- Better Bounds for Incremental Medians (Q5443384) (← links)
- Robust Independence Systems (Q5892606) (← links)
- Approximation algorithms for hierarchical location problems (Q5920573) (← links)
