8 search results - page 1 / 2 » Approximation Algorithms for Disjoint st-Paths with Minimum ... |
167
click to vote
JCO
2007
15 years 5 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
152
click to vote
IPL
2007
15 years 5 months ago
2007
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
217
click to vote
APPROX
2000
Springer
15 years 10 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...
141
Voted
TASLP
2010
15 years 15 days ago
2010
We consider the problem of extracting the source signals from an under-determined convolutive mixture assuming known mixing filters. State-of-the-art methods operate in the time-fr...
158
click to vote
FOCS
2008
IEEE
16 years 7 days ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...