447 search results - page 27 / 90 » Approximation Algorithms for Directed Steiner Problems |
110
click to vote
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
233
click to vote
ICDE
2009
IEEE
16 years 3 months ago
2009
IEEE
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
105
click to vote
ICALP
1998
Springer
15 years 5 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
106
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
155
Voted
APPROX
2000
Springer
15 years 5 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...