2137 search results - page 122 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
116
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
145
Voted
WEA
2005
Springer
15 years 10 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
161
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
165
click to vote
HYBRID
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Biological systems involving genetic reactions are large discrete event systems, and often contain certain species that occur in small quantities, and others that occur i...
138
Voted
STRINGOLOGY
2008
15 years 6 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...