Sciweavers

778 search results - page 149 / 156
» Bounding Smooth Integers
Sort
View
AB
2007
Springer
13 years 11 months ago
Efficient Haplotype Inference with Pseudo-boolean Optimization
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
Ana Graça, João Marques-Silva, In&ec...
COCOON
2008
Springer
13 years 9 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
CPAIOR
2008
Springer
13 years 9 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
APPROX
2010
Springer
193views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
MohammadHossein Bateni, Julia Chuzhoy