598 search results - page 53 / 120 » Approximation Algorithms for the Bottleneck Stretch Factor P... |
127
click to vote
WDAG
2009
Springer
15 years 7 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...
131
click to vote
MST
2007
15 years 2 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
132
click to vote
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
124
click to vote
EMNLP
2010
15 years 27 days ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
155
click to vote
ECRTS
2009
IEEE
15 years 20 days ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...