Sciweavers

558 search results - page 72 / 112
» Trees and Matchings
Sort
View
STACS
2010
Springer
15 years 6 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
BMCBI
2007
131views more  BMCBI 2007»
14 years 12 months ago
An improved method for identifying functionally linked proteins using phylogenetic profiles
Background: Phylogenetic profiles record the occurrence of homologs of genes across fully sequenced organisms. Proteins with similar profiles are typically components of protein c...
Shawn Cokus, Sayaka Mizutani, Matteo Pellegrini
CORR
2010
Springer
145views Education» more  CORR 2010»
14 years 12 months ago
CAT-generation of ideals
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
Torsten Ueckerdt
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 6 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 6 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella