3874 search results - page 145 / 775 » Approximation Algorithms for k-hurdle Problems |
130
click to vote
COCOON
2010
Springer
15 years 5 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
152
click to vote
MST
2010
14 years 8 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
135
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
111
click to vote
ALGORITHMICA
1999
15 years 1 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
101
Voted
DAC
1998
ACM
16 years 2 months ago
1998
ACM
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...