189 search results - page 14 / 38 » A generalization of the integer linear infeasibility problem |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
WG
2007
Springer
14 years 1 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
COR
2010
13 years 7 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
ISLPED
2003
ACM
14 years 26 days ago
2003
ACM
The power consumption of a sequential circuit can be reduced by decomposing it into subcircuits which can be turned off when inactive. Power can also be reduced by careful state e...