3415 search results - page 209 / 683 » Lower bounds on kernelization |
173
click to vote
SIAMJO
2010
15 years 1 months ago
2010
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
155
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
132
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
138
click to vote
ICRA
2008
IEEE
16 years 20 days ago
2008
IEEE
— This paper relates 5 observability indexes for robot calibration to the “alphabet optimalities” from the experimental design literature. These 5 observability indexes are s...
177
Voted
WAOA
2007
Springer
16 years 10 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...