7006 search results - page 952 / 1402 » Approximation Algorithms |
151
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Identical products being sold at different prices in different locations is a common phenomenon. To model such scenarios, we supplement the classical Fisher market model by intro...
176
Voted
KDD
2003
ACM
16 years 7 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
182
click to vote
ISAAC
2004
Springer
16 years 7 days ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
210
Voted
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
167
Voted
ATMOS
2010
15 years 5 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...