986 search results - page 95 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
126
Voted
CP
2003
Springer
15 years 9 months ago
2003
Springer
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
99
Voted
ANOR
2007
15 years 3 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
122
Voted
CCR
2008
15 years 3 months ago
2008
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
126
Voted
IPCO
1998
15 years 5 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
147
Voted
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...