496 search results - page 72 / 100 » A Polynomial-Time Approximation Algorithm for a Geometric Di... |
MST
2010
13 years 2 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
LION
2009
Springer
14 years 2 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
COMPGEOM
2010
ACM
14 years 23 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...