59 search results - page 8 / 12 » Odd Cycle Packing |
CPM
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
CLUSTER
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper presents an analysis of utilizing unused cycles on supercomputers through the use of many small jobs. What we call “interstitial computing,” is important to superco...
111
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
AGILEDC
2007
IEEE
15 years 6 months ago
2007
IEEE
In the agile and user-centered design (UCD) communities it is often believed that agile’s quick development cycles do not allow time to fully understand our user’s needs. In o...