Sciweavers

74 search results - page 3 / 15
» New length bounds for cycle bases
Sort
View
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
14 years 10 days ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
MP
2006
88views more  MP 2006»
13 years 6 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
COMGEO
2007
ACM
13 years 6 months ago
Geometric dilation of closed planar curves: New lower bounds
Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all...
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Kl...
EOR
2006
104views more  EOR 2006»
13 years 6 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 1 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...