179 search results - page 29 / 36 » Polynomial Time Approximation Schemes for Geometric k-Cluste... |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
ESA
2003
Springer
14 years 1 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
DCOSS
2008
Springer
13 years 9 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...