500 search results - page 69 / 100 » Approximation algorithms for maximum independent set of pseu... |
146
click to vote
ESA
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
111
click to vote
IANDC
2006
15 years 1 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
102
Voted
STOC
2002
ACM
16 years 2 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
108
click to vote
DAM
2007
15 years 1 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
102
click to vote
SMA
2005
ACM
15 years 7 months ago
2005
ACM
Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greate...