Space-efficient online computation of quantile summaries
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.
Why and Where: A Characterization of Data Provenance
- P. Buneman, S. Khanna, W. Tan
- Computer ScienceInternational Conference on Database Theory
- 4 January 2001
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.
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
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.
A PTAS for the multiple knapsack problem
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.
On syntactic versus computational views of approximability
- S. Khanna, R. Motwani, M. Sudan, U. Vazirani
- Computer ScienceProceedings 35th Annual Symposium on Foundations…
- 20 November 1994
This work attempts to reconcile the two distinct views of approximation classes: syntactic and computational, and provides a syntactic characterization of computational classes, and a computational framework for syntactic classes.
Complexity classifications of Boolean constraint satisfaction problems
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.
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- V. Guruswami, S. Khanna, R. Rajaraman, F. B. Shepherd, M. Yannakakis
- Computer Science, MathematicsSymposium on the Theory of Computing
- 1 May 1999
It is shown that in directed networks, for any e>0, EDP is NP-hard to approximate within m1/2-e even in undirected networks, and design simple approximation algorithms that achieve essentially matching approximation guarantees for some generalizations of EDP.
Approximation schemes for minimizing average weighted completion time with release dates
- F. Afrati, E. Bampis, M. Sviridenko
- Computer Science40th Annual Symposium on Foundations of Computer…
- 17 October 1999
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.
On multi-dimensional packing problems
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.
The Approximability of Constraint Satisfaction Problems
- S. Khanna, M. Sudan, L. Trevisan, David P. Williamson
- Computer ScienceSIAM journal on computing (Print)
- 1 December 2001
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.