7006 search results - page 432 / 1402 » Approximation Algorithms |
149
Voted
SIGECOM
2003
ACM
15 years 10 months ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
166
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
144
click to vote
ICPR
2004
IEEE
16 years 6 months ago
2004
IEEE
This paper presents a new background light intensity normalization algorithm suitable for historical document images. The algorithm uses an adaptive linear function to approximate...
117
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
129
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into f , the f-dimensional Fibonacci cube. We give b...