• Publications
  • Influence
Space-efficient online computation of quantile summaries
TLDR
The actual space bounds obtained on experimental data are significantly better than the worst case guarantees of the algorithm as well as the observed space requirements of earlier algorithms. Expand
Why and Where: A Characterization of Data Provenance
TLDR
An approach to computing provenance when the data of interest has been created by a database query is described, adopting a syntactic approach and present results for a general data model that applies to relational databases as well as to hierarchical data such as XML. Expand
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
TLDR
A polynomial time approximation scheme (PTAS) for MKP, which appears to be the strongest special case of GAP that is not APX-hard, and a PTAS-preserving reduction from an arbitrary instance of MKP to an instance with distinct sizes and profits. Expand
A PTAS for the multiple knapsack problem
TLDR
The main result of this paper is a polynomial time approximation scheme for MKP, which helps demarcate the boundary at which instances of GAP become APX-hard. Expand
Approximation schemes for minimizing average weighted completion time with release dates
TLDR
This work presents the first known polynomial time approximation schemes for several variants of the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. Expand
Complexity classifications of Boolean constraint satisfaction problems
TLDR
Theorems for Optimization Problems and the Complexity of the Meta-Problems are discussed, as well as some examples of how classification theorems can be applied to optimization problems. Expand
On Syntactic versus Computational Views of Approximability
TLDR
A general paradigm, nonoblivious local search, useful for developing simple yet efficient approximation algorithms is developed and it is shown that such algorithms can find good approximations for all MAX SNP problems, yielding approximation ratios comparable to the best known for a variety of specific MAX SNP-hard problems. Expand
On multi-dimensional packing problems
TLDR
Packing integer programs capture a core problem that directly relates to both vector scheduling and vector bin packing, namely, the problem of packing a miximum number of vectors in a single bin of unit height. Expand
On propagation of deletions and annotations through views
TLDR
The two problems correspond to two fundamentally distinct notions of provenance, why and where-provenance, which gives important insights into computational issues involved in data provenance or lineage --- the process by which data moves through databases. Expand
The Approximability of Constraint Satisfaction Problems
TLDR
Tight bounds on the "approximability" of every problem in Max Ones, Min CSP, and Min Ones are determined and this completely classifies all optimization problems derived from Boolean constraint satisfaction. Expand
...
1
2
3
4
5
...