1332 search results - page 200 / 267 » Combinatorial Algorithms |
VLDB
2007
ACM
14 years 2 months ago
2007
ACM
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
EVOW
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...