1671 search results - page 25 / 335 » On the Covering Steiner Problem |
LATIN
2010
Springer
14 years 4 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
JNCA
2011
13 years 1 months ago
2011
Recently, several studies have been conducted to design mobility‐based multicast routing protocols for wireless mobile ad hoc networks (MANET). These ...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
ESA
2007
Springer
14 years 5 months ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
SODA
2010
ACM
13 years 8 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...