Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...