1 paper
Sharath Raghvendra, Pouyan Shirzadian, Rachita Sowle
For any given metric space, obtaining an offline optimal solution to the classical k-server problem can be reduced to solving a minimum-cost partial bipartite matching between tw…