2944 search results - page 40 / 589 » Improving Bound Propagation |
JAL
2006
13 years 7 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
JCT
2006
13 years 7 months ago
2006
TALG
2008
13 years 7 months ago
2008
COMBINATORICS
2004
13 years 7 months ago
2004
A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet k on k letters, an abelian squarefree word is max...