Sciweavers

1257 search results - page 63 / 252
» A generalization of Euler's constant
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
ESA
2004
Springer
98views Algorithms» more  ESA 2004»
14 years 2 months ago
Competitive Online Approximation of the Optimal Search Ratio
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elm...
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
14 years 1 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
IWMM
1998
Springer
117views Hardware» more  IWMM 1998»
14 years 1 months ago
Guaranteeing Non-Disruptiveness and Real-Time Deadlines in an Incremental Garbage Collector
For Garbage Collection (GC) to be a generally accepted means of memory management it is required to prove its efficiency. This paper presents a scheme that guarantees that an incr...
Fridtjof Siebert
COCOON
2006
Springer
14 years 18 days ago
A PTAS for Cutting Out Polygons with Lines
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
Sergey Bereg, Ovidiu Daescu, Minghui Jiang