Sciweavers

574 search results - page 33 / 115
» Approximation Algorithms for Free-Label Maximization
Sort
View
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
14 years 2 months ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
STACS
2007
Springer
14 years 2 months ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis
WSCG
2004
106views more  WSCG 2004»
13 years 10 months ago
Recognition of Occluded Objects Using Curvature
New approaches of object representation reliable for partially occluded objects recognition are introduced in this article. Objects are represented by their boundaries, which are ...
Filip Krolupper
IPL
2007
94views more  IPL 2007»
13 years 8 months ago
The finite horizon investor problem with a budget constraint
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
Asaf Levin
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
14 years 9 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh