• Publications
  • Influence
On profit-maximizing envy-free pricing
TLDR
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
  • 323
  • 55
  • PDF
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
TLDR
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
  • 202
  • 40
  • PDF
Approximation schemes for minimizing average weighted completion time with release dates
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
  • 197
  • 30
  • PDF
Greedy bidding strategies for keyword auctions
TLDR
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
  • 162
  • 23
  • PDF
How to rank with few errors
TLDR
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
  • 241
  • 17
  • PDF
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
TLDR
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
  • 117
  • 14
  • PDF
Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
TLDR
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
  • 69
  • 11
  • PDF
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions
TLDR
Theorem 4.2 gives an improved (though still exponential) upper bound on block sensitivity in terms of sensitivity. Expand
  • 51
  • 9
  • PDF
Approximation schemes for multidimensional packing
TLDR
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
  • 39
  • 9
  • PDF
Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
TLDR
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
  • 87
  • 8
  • PDF