Sciweavers

601 search results - page 110 / 121
» Edge-dominating cycles in graphs
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 9 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
BMCBI
2008
96views more  BMCBI 2008»
13 years 8 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
BMCBI
2006
119views more  BMCBI 2006»
13 years 8 months ago
A methodology for the structural and functional analysis of signaling and regulatory networks
Background: Structural analysis of cellular interaction networks contributes to a deeper understanding of network-wide interdependencies, causal relationships, and basic functiona...
Steffen Klamt, Julio Saez-Rodriguez, Jonathan A. L...
ECCV
2004
Springer
14 years 10 months ago
A Statistical Model for General Contextual Object Recognition
We consider object recognition as the process of attaching meaningful labels to specific regions of an image, and propose a model that learns spatial relationships between objects....
Peter Carbonetto, Nando de Freitas, Kobus Barnard
CORR
2006
Springer
146views Education» more  CORR 2006»
13 years 8 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram