Sciweavers

727 search results - page 39 / 146
» One line and n points
Sort
View
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
15 years 1 months ago
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
Khaled M. Elbassioni, René Sitters, Yan Zha...
90
Voted
ESA
2009
Springer
74views Algorithms» more  ESA 2009»
15 years 4 months ago
On Inducing Polygons and Related Problems
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prov...
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc ...
CIAC
2006
Springer
84views Algorithms» more  CIAC 2006»
15 years 1 months ago
In-Place Randomized Slope Selection
Slope selection is a well-known algorithmic tool used in the context of computing robust estimators for fitting a line to a collection P of n points in the plane. We demonstrate th...
Henrik Blunck, Jan Vahrenhold
COCOON
2005
Springer
15 years 3 months ago
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...
Fabien Baille, Evripidis Bampis, Christian Lafores...
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
14 years 11 months ago
On the number of rectangular partitions
How many ways can a rectangle be partitioned into smaller ones? We study two variants of this problem: when the partitions are constrained to lie on n given points (no two of whic...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter