7129 search results - page 75 / 1426 » Approximation Algorithms for Treewidth |
117
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
116
Voted
SIAMCOMP
2010
15 years 1 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
146
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
144
Voted
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
114
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...