64 search results - page 10 / 13 » Approximability of Edge Matching Puzzles |
206
Voted
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
164
click to vote
BICOB
2009
Springer
16 years 13 days ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
169
click to vote
ALENEX
2009
15 years 7 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
167
click to vote
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
164
click to vote
FSTTCS
2010
Springer
15 years 3 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...