5889 search results - page 357 / 1178 » Graph Layout Problems |
173
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
161
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
155
click to vote
IPL
2006
15 years 6 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
231
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
157
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the...