3415 search results - page 376 / 683 » Lower bounds on kernelization |
198
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
188
click to vote
EJC
2008
15 years 6 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
169
click to vote
AMC
2006
15 years 6 months ago
2006
Missing values in inputs, outputs cannot be handled by the original data envelopment analysis (DEA) models. In this paper we introduce an approach based on interval DEA that allow...
150
click to vote
JAIR
2008
15 years 6 months ago
2008
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language (TBBL) that is co...
187
click to vote
DC
2007
2007
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
15 years 6 months ago
This paper provides description and analysis of a new clock synchronization algorithm for synchronous and partially synchronous systems with unknown upper and lower bounds on delay...