1433 search results - page 91 / 287 » On Covering Problems of Rado |
343
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
137
click to vote
CPM
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
185
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
155
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
: Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic app...
152
click to vote
DISOPT
2006
15 years 6 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...