2698 search results - page 140 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
194
click to vote
CPM
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
157
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
154
click to vote
SIAMCO
2002
15 years 6 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
182
click to vote
NETWORKS
2002
15 years 6 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
203
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...