360 search results - page 67 / 72 » The TV-Break Packing Problem |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
EVOW
2012
Springer
13 years 7 months ago
2012
Springer
This paper presents HyFlex, a software framework for the development of cross-domain search methodologies. The framework features a common software interface for dealing with diff...
124
click to vote
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
ECCC
2000
14 years 11 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...