1272 search results - page 128 / 255 » Approximate Parameterized Matching |
156
Voted
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
142
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
134
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
140
Voted
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
179
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...