nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...