1279 search results - page 140 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
108
click to vote
SIGECOM
2005
ACM
15 years 7 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
120
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
110
click to vote
ICTAI
2009
IEEE
15 years 8 months ago
2009
IEEE
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
112
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
146
click to vote
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...