791 search results - page 74 / 159 » Approximating the Maximum Sharing Problem |
ALGORITHMICA
2004
13 years 7 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
MST
2007
13 years 7 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...