207 search results - page 28 / 42 » Improved Approximation Algorithm for Connected Facility Loca... |
115
Voted
FOCS
1995
IEEE
15 years 3 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
80
Voted
MFCS
2007
Springer
15 years 5 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
118
click to vote
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
103
click to vote
BMCBI
2006
14 years 11 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...