367 search results - page 3 / 74 » Set connectivity problems in undirected graphs and the direc... |
ISAAC
2004
Springer
13 years 11 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
WADS
2009
Springer
14 years 29 days ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
ESA
2007
Springer
14 years 16 days ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
SIAMCOMP
2010
13 years 1 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...