Sanjeev Khanna | University of Pennsylvania (original) (raw)

Papers by Sanjeev Khanna

Research paper thumbnail of Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs

Combinatorica, 2010

In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected... more In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to route as many terminal pairs as possible, subject to the constraint that at most c demands can be routed through any edge in the graph. When c = 1,

Research paper thumbnail of The Power of Local Information in Social Networks

Lecture Notes in Computer Science, 2012

Research paper thumbnail of Why and where: A characterization of data provenance

Lecture notes in computer science, Jan 1, 2001

With the proliferation of database views and curated data- bases, the issue of data provenance - ... more With the proliferation of database views and curated data- bases, the issue of data provenance - where a piece of data came from and the process by which it arrived in the database - is becoming increasingly important, especially in scientific databases where understanding provenance is crucial to the accuracy and currency of data. In this paper we describe an approach to computing provenance when the data of interest has been created by a database query. We adopt 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 novel aspect of our work is a distinction between “why” provenance (refers to the source data that had some influence on the existence of the data) and “where” provenance (refers to the location(s) in the source databases from which the data was extracted). Supported in part by an Alfred P. Sloan Research Fellowship.

Research paper thumbnail of Complexity classifications of boolean constraint satisfaction problems

... p. cm. — (SIAM monographs on discrete mathematics and applications ... Such a calculus charac... more ... p. cm. — (SIAM monographs on discrete mathematics and applications ... Such a calculus characterizing the complexity of computational problems is obviously of interest to "complexity theory" — the area that studies the computational complexity of solving mathematical problems. ...

Research paper thumbnail of Space-efficient online computation of quantile summaries

ACM SIGMOD Record, Jan 1, 2001

Research paper thumbnail of Archiving Scientific Data

ACM Transactions on …, Jan 1, 2004

Research paper thumbnail of A PTAS for the multiple knapsack problem

Proceedings of the eleventh annual ACM- …, Jan 1, 2000

Research paper thumbnail of Approximation schemes for minimizing average weighted completion time with release dates

Research paper thumbnail of Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

Proceedings of the …, Jan 1, 1999

... Venkatesan Gumswami' Sanjeev Khannat Rajmohan Rajaramanr ... A feasible solution is ... more ... Venkatesan Gumswami' Sanjeev Khannat Rajmohan Rajaramanr ... A feasible solution is a subset S of the (sir ti) pairs such that demands associated with pairs in S can be fully met through a routing which re-spects all capacity constraints, and the objective is to maxi-mize the ...

Research paper thumbnail of On syntactic versus computational views of approximability

… of Computer Science, …, Jan 1, 1994

On Syntactic versus Computational Views of Approximability ... SANJEEV -ANNA* RAJEEV MOTWANI* MAD... more On Syntactic versus Computational Views of Approximability ... SANJEEV -ANNA* RAJEEV MOTWANI* MADHU SUDAN+ UMESH VAZIRANI~ Stanford University Stanford University IBM Research ... We attempt to reconcile the two distinct views of ap-proximation classes: ...

Research paper thumbnail of Data provenance: Some basic issues

Lecture notes in computer science, Jan 1, 2000

The ease with which one can copy and transform data on the Web, has made it increasingly difficul... more The ease with which one can copy and transform data on the Web, has made it increasingly difficult to determine the origins of a piece of data. We use the term data provenance to refer to the process of tracing and recording the origins of data and its movement between databases. Provenance is now an acute issue in scientific databases where it is central to the validation of data. In this paper we discuss some of the technical issues that have emerged in an initial exploration of thetopic.

Research paper thumbnail of On Propagation of Deletions and Annotations Through Views

… of the twenty-first ACM SIGMOD- …, Jan 1, 2002

Research paper thumbnail of Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs

Combinatorica, 2010

In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected... more In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to route as many terminal pairs as possible, subject to the constraint that at most c demands can be routed through any edge in the graph. When c = 1,

Research paper thumbnail of The Power of Local Information in Social Networks

Lecture Notes in Computer Science, 2012

Research paper thumbnail of Why and where: A characterization of data provenance

Lecture notes in computer science, Jan 1, 2001

With the proliferation of database views and curated data- bases, the issue of data provenance - ... more With the proliferation of database views and curated data- bases, the issue of data provenance - where a piece of data came from and the process by which it arrived in the database - is becoming increasingly important, especially in scientific databases where understanding provenance is crucial to the accuracy and currency of data. In this paper we describe an approach to computing provenance when the data of interest has been created by a database query. We adopt 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 novel aspect of our work is a distinction between “why” provenance (refers to the source data that had some influence on the existence of the data) and “where” provenance (refers to the location(s) in the source databases from which the data was extracted). Supported in part by an Alfred P. Sloan Research Fellowship.

Research paper thumbnail of Complexity classifications of boolean constraint satisfaction problems

... p. cm. — (SIAM monographs on discrete mathematics and applications ... Such a calculus charac... more ... p. cm. — (SIAM monographs on discrete mathematics and applications ... Such a calculus characterizing the complexity of computational problems is obviously of interest to "complexity theory" — the area that studies the computational complexity of solving mathematical problems. ...

Research paper thumbnail of Space-efficient online computation of quantile summaries

ACM SIGMOD Record, Jan 1, 2001

Research paper thumbnail of Archiving Scientific Data

ACM Transactions on …, Jan 1, 2004

Research paper thumbnail of A PTAS for the multiple knapsack problem

Proceedings of the eleventh annual ACM- …, Jan 1, 2000

Research paper thumbnail of Approximation schemes for minimizing average weighted completion time with release dates

Research paper thumbnail of Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

Proceedings of the …, Jan 1, 1999

... Venkatesan Gumswami' Sanjeev Khannat Rajmohan Rajaramanr ... A feasible solution is ... more ... Venkatesan Gumswami' Sanjeev Khannat Rajmohan Rajaramanr ... A feasible solution is a subset S of the (sir ti) pairs such that demands associated with pairs in S can be fully met through a routing which re-spects all capacity constraints, and the objective is to maxi-mize the ...

Research paper thumbnail of On syntactic versus computational views of approximability

… of Computer Science, …, Jan 1, 1994

On Syntactic versus Computational Views of Approximability ... SANJEEV -ANNA* RAJEEV MOTWANI* MAD... more On Syntactic versus Computational Views of Approximability ... SANJEEV -ANNA* RAJEEV MOTWANI* MADHU SUDAN+ UMESH VAZIRANI~ Stanford University Stanford University IBM Research ... We attempt to reconcile the two distinct views of ap-proximation classes: ...

Research paper thumbnail of Data provenance: Some basic issues

Lecture notes in computer science, Jan 1, 2000

The ease with which one can copy and transform data on the Web, has made it increasingly difficul... more The ease with which one can copy and transform data on the Web, has made it increasingly difficult to determine the origins of a piece of data. We use the term data provenance to refer to the process of tracing and recording the origins of data and its movement between databases. Provenance is now an acute issue in scientific databases where it is central to the validation of data. In this paper we discuss some of the technical issues that have emerged in an initial exploration of thetopic.

Research paper thumbnail of On Propagation of Deletions and Annotations Through Views

… of the twenty-first ACM SIGMOD- …, Jan 1, 2002