1723 search results - page 10 / 345 » Cycling in linear programming problems |
COCOON
2010
Springer
13 years 8 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— Dual-failure scenarios are a real possibility in today’s optical networks and it is becoming more and more important for carriers and network operators to consider them when ...
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...