Search Sciweavers | Sciweavers

10

DISOPT
2006

90views more DISOPT 2006»

Tree decompositions of graphs: Saving memory in dynamic programming

13 years 4 months ago

We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...

Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann

claim paper

Read More »

11

click to vote

DISOPT
2006

110views more DISOPT 2006»

New facets of the STS polytope generated from known facets of the ATS polytope

13 years 4 months ago

Download www.dei.unipd.it

While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...

Egon Balas, Robert Carr, Matteo Fischetti, Neil Si...

claim paper

Read More »

12

click to vote

DISOPT
2007

93views more DISOPT 2007»

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

13 years 4 months ago

Download www.cs.put.poznan.pl

We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...

Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...

claim paper

Read More »

16

click to vote

DISOPT
2006

155views more DISOPT 2006»

Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms

13 years 4 months ago

Download pluto.mscc.huji.ac.il

We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...

Dorit S. Hochbaum, Asaf Levin

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers