6740 search results - page 406 / 1348 » An s -Hamiltonian Line Graph Problem |
154
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...
229
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...
155
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...
193
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
174
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...