SIAMCOMP
2016
8 years 11 months ago
2016
Motivated by the fact that distances between data points in many real-world clustering instances are often based on heuristic measures, Bilu and Linial [6] proposed analyzing objec...
SIAMCOMP
2016
8 years 11 months ago
2016
SIAMCOMP
2016
8 years 11 months ago
2016
In the online Steiner tree problem, a sequence of points is revealed one-by-one: when a point arrives, we only have time to add a single edge connecting this point to the previous...
105
click to vote
SIAMCOMP
2016
8 years 11 months ago
2016
We study a combinatorial market design problem, where a collection of indivisible objects is to be priced and sold to potential buyers subject to equilibrium constraints. The clas...