We study the problem of pricing items for sale to consumers so as to maximize the seller's revenue by finding envy-free prices that maximize seller profit and at the same time are envy free.Expand

We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classicalNP-hard cutting-stock problem.Expand

40th Annual Symposium on Foundations of Computerâ€¦

17 October 1999

TLDR

In this paper, we present the first PTASs for scheduling to minimize average weighted completion time in the presence of release dates in various machine models.Expand

We consider greedy bidding strategies for a repeated auction on a single keyword, where in each round, each player chooses some optimal bid for the next round, assuming that the other players merely repeat their previous bid.Expand

We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments and a weighted generalization for Kemeny-Young rank aggregation.Expand

We study the following packing problem: Given a collection of d-dimensional rectangles of specified sizes, pack them into the minimum number of unit cubes.Expand

We show that an integrality gap of 2 - e persists up to a linear number of rounds of Sherali-Adams, despite the fact that Knapsack admits a fully polynomial time approximation scheme.Expand

We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into at most OPT bins whose sides have length (1 + Îµ), where OPT denotes the minimum number of unit bins required.Expand

We give the first polynomial-time approximation schemes (PTASs) for the following problems: (1) uniform facility location in edge-weighted planar graphs, (2) k-median and k-means clustering in Euclidean space of bounded dimension.Expand