Results 11  20
of
96
Tight bounds for Planar Strongly Connected Steiner Subgraph with fixed number of terminals (and extensions)
 IN SODA
, 2014
"... Given a vertexweighted directed graph G = (V,E) and a set T = {t1, t2,... tk} of k terminals, the objective of the STRONGLY CONNECTED STEINER SUBGRAPH (SCSS) problem is to find a vertex set H ⊆V of minimum weight such that G[H] contains a ti → t j path for each i 6 = j. The problem is NPhard, but ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
for planar SCSS, which is an improvement of a factor of O( k) in the exponent over the algorithm of Feldman and Ruhl. • Our main hardness result is a matching lower bound for our algorithm: we show that planar SCSS does not have an f (k) · no( k) algorithm for any computable function f, unless
Lower Bounds for Maximum Parsimony with Gene Order Data
 RECOMB Comparative Genomics
"... Abstract. In this paper, we study lower bound techniques for branchandbound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3) time dynamic programming algorithm for computing the maximum circular ordering lower bound. The wellknown gene order phylogeny pro ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract. In this paper, we study lower bound techniques for branchandbound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3) time dynamic programming algorithm for computing the maximum circular ordering lower bound. The wellknown gene order phylogeny
New Results on the Distance Between a Segment and Z2. Application to the Exact Rounding
"... This paper presents extensions to Lefèvre’s algorithm that computes a lower bound on the distance between a segment and a regular grid Z2. This algorithm and, in particular, the extensions are useful in the search for worst cases for the exact rounding of unary elementary functions or baseconver ..."
Abstract
 Add to MetaCart
This paper presents extensions to Lefèvre’s algorithm that computes a lower bound on the distance between a segment and a regular grid Z2. This algorithm and, in particular, the extensions are useful in the search for worst cases for the exact rounding of unary elementary functions or base
unknown title
"... Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objective function is being maximized and can be rewritten as the difference of two nondecreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever expl ..."
Abstract
 Add to MetaCart
of the generalized algorithm, we notice that the branchandbound is the popular method to solve integer linear programming problems. But branchandbound cannot efficiently solve all integer linear programming problems. For example, De Loera et al. in their 2005 paper discuss some knapsack problems that CPLEX
unknown title
"... Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objective function is being maximized and can be rewritten as the difference of two nondecreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever expl ..."
Abstract
 Add to MetaCart
of the generalized algorithm, we notice that the branchandbound is the popular method to solve integer linear programming problems. But branchandbound cannot efficiently solve all integer linear programming problems. For example, De Loera et al. in their 2005 paper discuss some knapsack problems that CPLEX
A* with partial expansion for large branching factor problems
 In Proceedings of AAAI00
, 2000
"... The multiple sequence alignment problem is one of the important problems in Genome Informatics. The notable feature of this problem is that its statespace forms a lattice. Researchers have applied search algorithms such as A * and memorybounded search algorithms including SNC to this problem. Un ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
and effective search algorithm, A * with Partial Expansion, for statespaces with large branching factors. The aim of this algorithm is to store only necessary nodes for finding an optimal solution. In node expansion, A * stores all child nodes, while our algorithm stores only promising child nodes
A survey of algorithms for construction of optimal Heterogeneous Bounding Volume Hierarchies
"... In this paper we describe algorithms for automatic object hierarchy construction. We also describe a set of properties that hierarchies must possess to be considered optimal. Based on knowledge from existing algorithms we develop and evaluate a Branch and Bound construction algorithm that searche ..."
Abstract
 Add to MetaCart
In this paper we describe algorithms for automatic object hierarchy construction. We also describe a set of properties that hierarchies must possess to be considered optimal. Based on knowledge from existing algorithms we develop and evaluate a Branch and Bound construction algorithm
INSTITUT DE ROB `OTICA I INFORM `ATICA INDUSTRIAL PREPRINT 1 A BranchandPrune Solver for Distance Constraints
"... Abstract — Given some geometric elements such as points and lines in , subject to a set of pairwise distance constraints, the problem tackled in this paper is that of finding all possible configurations of these elements that satisfy the constraints. Many problems in Robotics (such as the position ..."
Abstract
 Add to MetaCart
. Finding these distances relies on a branchandprune technique that iteratively eliminates from the space of distances entire regions which cannot contain any solution. This elimination is accomplished by applying redundant necessary conditions derived from the theory of Distance Geometry
46 All&e d’Italie
"... This paper is a study of onetoall and alltoall data movement patterns on cycles, tori, and multidimensional tori that use synchronous circuitswitched routing with virtual channels. The data movement patterns that we study are broadcasting, scattering, gossiping, and multiscattering. We pres ..."
Abstract
 Add to MetaCart
are “short ” and storeandforward routing is best for long messages. Surprisingly, a few of our new circuitswitching algorithms outperform all known storeandforward algorithms for all message lengths. 1
New Efficient BitParallel Algorithms for the δMatching Problem with αBounded Gaps in Musical Sequences
"... Abstract. We present new efficient variants of the (δ, α)SequentialSampling algorithm, recently introduced by the authors, for the δapproximate string matching problem with αbounded gaps. These algorithms, which have practical applications in music information retrieval and analysis, make use o ..."
Abstract
 Add to MetaCart
Abstract. We present new efficient variants of the (δ, α)SequentialSampling algorithm, recently introduced by the authors, for the δapproximate string matching problem with αbounded gaps. These algorithms, which have practical applications in music information retrieval and analysis, make use
Results 11  20
of
96