1040 search results - page 35 / 208 » Rounding algorithms for covering problems |
CORR
2011
Springer
13 years 15 days ago
2011
Springer
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
SPAA
2010
ACM
13 years 9 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
GEOINFO
2004
13 years 10 months ago
2004
: In this paper we approach the problems of rounding errors in geometric algorithms. Particularly, we are interested in geometric algorithms used by TerraLib
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
OPODIS
2007
13 years 10 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...