6740 search results - page 168 / 1348 » An s -Hamiltonian Line Graph Problem |
116
Voted
COR
2006
15 years 3 months ago
2006
A well known transformation by Pearn, Assad and Golden reduces a Capacitated Arc Routing Problem (CARP) into an equivalent Capacitated Vehicle Routing Problem (CVRP). However, tha...
111
Voted
SIAMDM
2008
15 years 3 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
127
Voted
SODA
1998
ACM
15 years 4 months ago
1998
ACM
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...
120
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
154
Voted
AAIM
2007
Springer
15 years 7 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...