331 search results - page 36 / 67 » Approximation Algorithms for Connected Dominating Sets |
IPL
2006
14 years 11 months ago
2006
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
104
click to vote
EC
2002
14 years 11 months ago
2002
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to nd a number of ...
117
click to vote
JUCS
2007
14 years 11 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
107
click to vote
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...