3415 search results - page 433 / 683 » Lower bounds on kernelization |
175
click to vote
EOR
2010
15 years 6 months ago
2010
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...
168
click to vote
DM
2008
15 years 6 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
180
click to vote
ADCM
2006
15 years 6 months ago
2006
Barycentric coordinates are unique for triangles, but there are many possible generalizations to convex polygons. In this paper we derive sharp upper and lower bounds on all baryc...
169
click to vote
COR
2006
15 years 6 months ago
2006
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
174
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...