7006 search results - page 187 / 1402 » Approximation Algorithms |
131
click to vote
ALGORITHMICA
2004
15 years 3 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
133
click to vote
STACS
2010
Springer
15 years 1 months ago
2010
Springer
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
121
click to vote
LATIN
2000
Springer
15 years 6 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
155
click to vote
JCO
2007
15 years 3 months ago
2007
The 2-interval pattern problem over its various models and restrictions was proposed by Vialette (2004) for the application of RNA secondary structure prediction. We present an O(n...
139
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...