Sciweavers

4266 search results - page 76 / 854
» The container loading problem
Sort
View
129
Voted
DISOPT
2007
93views more  DISOPT 2007»
15 years 2 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
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...
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
15 years 8 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis
92
Voted
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 7 months ago
Relativized NP Search Problems and Propositional Proof Systems
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
Josh Buresh-Oppenheim, Tsuyoshi Morioka
WG
2004
Springer
15 years 7 months ago
Decremental Clique Problem
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
Fabrizio Grandoni, Giuseppe F. Italiano
103
Voted
DM
2008
82views more  DM 2008»
15 years 2 months ago
Problems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
Noga Alon