Khanna, Sanjeev
Overview
Works:  30 works in 52 publications in 1 language and 276 library holdings 

Genres:  Conference papers and proceedings Criticism, interpretation, etc 
Roles:  Author, Editor 
Classifications:  QA75.5, 004.0151 
Publication Timeline
.
Most widely held works by
Sanjeev Khanna
Complexity classifications of Boolean constraint satisfaction problems by
Nadia Creignou(
Book
)
13 editions published in 2001 in English and held by 132 WorldCat member libraries worldwide
Publisher description: "Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal is to develop a framework for classifying the complexity of Boolean CSP in a uniform way. In doing so, they bring out common themes underlying many concepts and results in both algorithms and complexity theory. The results and techniques presented here show that Boolean CSP provide an excellent framework for discovering and formally validating global inferences about the nature of computation. This book presents a novel and compact form of a compendium that classifies an infinite number of problems by using a rulebased approach. This enables practitioners to determine whether or not a given problem is known to be computationally intractable."
13 editions published in 2001 in English and held by 132 WorldCat member libraries worldwide
Publisher description: "Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal is to develop a framework for classifying the complexity of Boolean CSP in a uniform way. In doing so, they bring out common themes underlying many concepts and results in both algorithms and complexity theory. The results and techniques presented here show that Boolean CSP provide an excellent framework for discovering and formally validating global inferences about the nature of computation. This book presents a novel and compact form of a compendium that classifies an infinite number of problems by using a rulebased approach. This enables practitioners to determine whether or not a given problem is known to be computationally intractable."
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 7th International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation,
RANDOM 2004, Cambridge, MA, USA, August 2224, 2004 : proceedings by
Klaus Jansen(
)
2 editions published in 2004 in English and held by 30 WorldCat member libraries worldwide
This book constitutes the joint refereed proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and the 8th International Workshop on Randomization and Computation, RANDOM 2004, held in Cambridge, MA, USA in August 2004. The 37 revised full papers presented were carefully reviewed and selected from 87 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, approximation classes, online problems, graph algorithms, cuts, geometric computations, network design and routing, packing and covering, scheduling, game theory, design and analysis of randomised algorithms, randomized complexity theory, pseudorandomness, derandomization, probabilistic proof systems, errorcorrecting codes, and other applications of approximation and randomness
2 editions published in 2004 in English and held by 30 WorldCat member libraries worldwide
This book constitutes the joint refereed proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and the 8th International Workshop on Randomization and Computation, RANDOM 2004, held in Cambridge, MA, USA in August 2004. The 37 revised full papers presented were carefully reviewed and selected from 87 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, approximation classes, online problems, graph algorithms, cuts, geometric computations, network design and routing, packing and covering, scheduling, game theory, design and analysis of randomised algorithms, randomized complexity theory, pseudorandomness, derandomization, probabilistic proof systems, errorcorrecting codes, and other applications of approximation and randomness
A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction by
Sanjeev Khanna(
Book
)
2 editions published in 1997 in English and held by 6 WorldCat member libraries worldwide
Abstract: "In this paper we study the approximability of boolean constraint satisfaction problems. A problem in this class consists of some collection of 'constraints' (i.e., functions f: [0,1][superscript k] > [0,1]); an instance of a problem is a set of constraints applied to specified subsets of n boolean variables. Schaefer earlier studied the question of whether one could find in polynomial time a setting of the variables satisfying all constraints; he showed that every such problem is either in P or is NPcomplete. We consider optimization variants of these problems in which one either tries to maximize the number of satisfied constraints (as in MAX 3SAT or MAX CUT) or tries to find an assignment satisfying all constraints which maximizes the number of variables set to 1 (as in MAX CUT or MAX CLIQUE). We completely classify the approximability of all such problems. In the first case, we show that any such optimization problem is either in P or is MAX SNPhard. In the second case, we show that such problems fall precisely into one of five classes: solvable in polynomialtime, approximable to within constant factors in polynomial time (but no better), approximable to within polynomial factors in polynomial time (but no better), not approximable to within any factor but decidable in polynomial time, and not decidable in polynomial time (unless P = NP). This result proves formally for this class of problems two results which to this point have only been empirical observations; namely, that NPhard problems in MAX SNP alwyas turn out to be MAX SNPhard, and that there seem to be no natural maximization problems approximable to within polylogarithmic factors but no better."
2 editions published in 1997 in English and held by 6 WorldCat member libraries worldwide
Abstract: "In this paper we study the approximability of boolean constraint satisfaction problems. A problem in this class consists of some collection of 'constraints' (i.e., functions f: [0,1][superscript k] > [0,1]); an instance of a problem is a set of constraints applied to specified subsets of n boolean variables. Schaefer earlier studied the question of whether one could find in polynomial time a setting of the variables satisfying all constraints; he showed that every such problem is either in P or is NPcomplete. We consider optimization variants of these problems in which one either tries to maximize the number of satisfied constraints (as in MAX 3SAT or MAX CUT) or tries to find an assignment satisfying all constraints which maximizes the number of variables set to 1 (as in MAX CUT or MAX CLIQUE). We completely classify the approximability of all such problems. In the first case, we show that any such optimization problem is either in P or is MAX SNPhard. In the second case, we show that such problems fall precisely into one of five classes: solvable in polynomialtime, approximable to within constant factors in polynomial time (but no better), approximable to within polynomial factors in polynomial time (but no better), not approximable to within any factor but decidable in polynomial time, and not decidable in polynomial time (unless P = NP). This result proves formally for this class of problems two results which to this point have only been empirical observations; namely, that NPhard problems in MAX SNP alwyas turn out to be MAX SNPhard, and that there seem to be no natural maximization problems approximable to within polylogarithmic factors but no better."
Joseph Conrad : his mind and art by
Sanjeev Khanna(
Book
)
2 editions published in 2008 in English and held by 6 WorldCat member libraries worldwide
Joseph Conrad, 18571924, English novelist
2 editions published in 2008 in English and held by 6 WorldCat member libraries worldwide
Joseph Conrad, 18571924, English novelist
Special issue on STOC 2000 : [6 papers whose preliminary versions appeared in the proceedings of the 32nd Annual ACM Symposium
on Theory of Computing, held in Portland, Oregon, May 21  23, 2000] by
2000, Portland, Or.> Symposium on Theory of Computing. <32(
Book
)
3 editions published in 2002 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 2002 in English and held by 5 WorldCat member libraries worldwide
On diameter verification and boolean matrix multiplication by
Julien Basch(
Book
)
2 editions published in 1995 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We present a practical algorithm that verifies whether a graph has diameter 2 in time O (n/logn). A slight adaptation of this algorithm yields a boolean matrix multiplication algorithm which runs in the same time bound; thereby allowing us to compute transitive closure and verification of the diameter of a graph for any constant d in O (n/logn) time
2 editions published in 1995 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We present a practical algorithm that verifies whether a graph has diameter 2 in time O (n/logn). A slight adaptation of this algorithm yields a boolean matrix multiplication algorithm which runs in the same time bound; thereby allowing us to compute transitive closure and verification of the diameter of a graph for any constant d in O (n/logn) time
Special issue on STOC 2003 : [... at the 35th ACM Symposium on Theory of Computing (STOC), held in San Diego on June 911,
2003] by
Symposium on Theory of Computing(
Book
)
3 editions published in 2004 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 2004 in English and held by 5 WorldCat member libraries worldwide
Approximation algorithms for the largest common subtree problem by
Sanjeev Khanna(
Book
)
1 edition published in 1995 in English and held by 4 WorldCat member libraries worldwide
Abstract: "The largest common subtree problem is to find a largest tree which occurs as a common subgraph in a given collection of trees. Let n denote the number of vertices in the largest tree in the collection. We show that in the case of bounded degree trees, it is possible to achieve an approximation ratio of O(n(log log n)/logn). For unbounded degree trees, we give an algorithm with approximation ratio O(n(log log n)/logn) when the trees are unlabeled. An approximation ratio of O(n(log log n)/logn) is also achieved for the case of labeled unbounded degree trees provided the number of distinct labels is O(log[superscript 0(1)]n)."
1 edition published in 1995 in English and held by 4 WorldCat member libraries worldwide
Abstract: "The largest common subtree problem is to find a largest tree which occurs as a common subgraph in a given collection of trees. Let n denote the number of vertices in the largest tree in the collection. We show that in the case of bounded degree trees, it is possible to achieve an approximation ratio of O(n(log log n)/logn). For unbounded degree trees, we give an algorithm with approximation ratio O(n(log log n)/logn) when the trees are unlabeled. An approximation ratio of O(n(log log n)/logn) is also achieved for the case of labeled unbounded degree trees provided the number of distinct labels is O(log[superscript 0(1)]n)."
On syntactic versus computational views of approximability by S Khanna(
Book
)
1 edition published in 1995 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We attempt to reconcile the two distinct views of approximation classes: syntactic and computational. Syntactic classes such as MAX SNP permit structural results and have natural complete problems, while computational classes such as APX allow us to work with classes of problems whose approximability is wellunderstood. Our results provide a syntactic characterization of computational classes, and give a computational framework for syntactic classes. We compare the syntactically defined class MAX SNP with the computationally defined class APX, and show that every problem in APX can be 'placed' (i.e., has approximation preserving reduction to a problem) in MAX SNP. Our methods introduce a general technique for creating approximationpreserving reductions which show that any 'well' approximable problem can be reduced in an approximationpreserving manner to a problem which is hard to approximate to corresponding factors. We demonstrate this technique by applying it to the classes RMAX(2) and MIN F+[pi]₂(1) which have the clique problem and the set cover problem, respectively, as complete problems. We use the syntactic nature of MAX SNP to define a general paradigm, non oblivious local search, useful for developing simple yet efficient approximation algorithms. We show that such algorithms can find good approximations for all MAX SNP problems, yielding approximation ratios comparable to the bestknown for a variety of specific MAX SNPhard problems. Nonoblivious local search provably outperforms standard local search in both the degree of approximation achieved and the efficiency of the resulting algorithms."
1 edition published in 1995 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We attempt to reconcile the two distinct views of approximation classes: syntactic and computational. Syntactic classes such as MAX SNP permit structural results and have natural complete problems, while computational classes such as APX allow us to work with classes of problems whose approximability is wellunderstood. Our results provide a syntactic characterization of computational classes, and give a computational framework for syntactic classes. We compare the syntactically defined class MAX SNP with the computationally defined class APX, and show that every problem in APX can be 'placed' (i.e., has approximation preserving reduction to a problem) in MAX SNP. Our methods introduce a general technique for creating approximationpreserving reductions which show that any 'well' approximable problem can be reduced in an approximationpreserving manner to a problem which is hard to approximate to corresponding factors. We demonstrate this technique by applying it to the classes RMAX(2) and MIN F+[pi]₂(1) which have the clique problem and the set cover problem, respectively, as complete problems. We use the syntactic nature of MAX SNP to define a general paradigm, non oblivious local search, useful for developing simple yet efficient approximation algorithms. We show that such algorithms can find good approximations for all MAX SNP problems, yielding approximation ratios comparable to the bestknown for a variety of specific MAX SNPhard problems. Nonoblivious local search provably outperforms standard local search in both the degree of approximation achieved and the efficiency of the resulting algorithms."
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques 7th International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on by
Klaus Jansen(
)
2 editions published in 2004 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 2004 in English and held by 2 WorldCat member libraries worldwide
A simulation model to determine the impact of operating conditions on an industrial hydotheating process by
Sanjeev Khanna(
)
2 editions published in 2001 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 2001 in English and held by 2 WorldCat member libraries worldwide
New algorithms for sequential diagnosis by
Sanjeev Khanna(
)
1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide
On certificates and lookahead in dynamic graph problems by
Sanjeev Khanna(
)
1 edition published in 1996 in English and held by 1 WorldCat member library worldwide
1 edition published in 1996 in English and held by 1 WorldCat member library worldwide
Page replacement for general caching problems by
Susanne Albers(
)
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
Approximation algorithms for the largest common subtree problem by Stanford University(
Book
)
1 edition published in 1995 in English and held by 1 WorldCat member library worldwide
The largest common subtree problem is to find a largest subtree which occurs as a common subgraph in a given collection of trees. We show that in case of bounded degree trees, we can achieve an approximation ratio of O((n*loglog n) / log[superscript]{2} n). In case of unbounded degree nodes, we give an algorithm with approximation ratio O((n*(loglog n)[superscript]{2}) / log[superscript]{2} n) when the trees are unlabeled. An approximation ratio of O((n*(loglog n)[superscript]{2}) / log[superscript]{2} n) is also achieved for the case of labeled unbounded degree trees provided the number of distinct labels is O(log[superscript]{O(1)} n)
1 edition published in 1995 in English and held by 1 WorldCat member library worldwide
The largest common subtree problem is to find a largest subtree which occurs as a common subgraph in a given collection of trees. We show that in case of bounded degree trees, we can achieve an approximation ratio of O((n*loglog n) / log[superscript]{2} n). In case of unbounded degree nodes, we give an algorithm with approximation ratio O((n*(loglog n)[superscript]{2}) / log[superscript]{2} n) when the trees are unlabeled. An approximation ratio of O((n*(loglog n)[superscript]{2}) / log[superscript]{2} n) is also achieved for the case of labeled unbounded degree trees provided the number of distinct labels is O(log[superscript]{O(1)} n)
A structural view of approximation by
Sanjeev Khanna(
Book
)
1 edition published in 1996 in English and held by 1 WorldCat member library worldwide
1 edition published in 1996 in English and held by 1 WorldCat member library worldwide
STOC 2000 by ACM Symposium on Theory of Computing(
)
1 edition published in 2002 in English and held by 1 WorldCat member library worldwide
1 edition published in 2002 in English and held by 1 WorldCat member library worldwide
Analysis for chaos and fractals in nonlinear dynamical systems by
Sanjeev Khanna(
Book
)
in English and held by 1 WorldCat member library worldwide
in English and held by 1 WorldCat member library worldwide
On multidimensional packing problems by
Chandra Chekuri(
)
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
Proceedings of the TwentyFourth Annual ACMSIAM Symposium on Discrete Algorithms by ACMSIAM Symposium on Discrete Algorithms(
)
1 edition published in 2013 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 2013 in English and held by 0 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Associated Subjects
Algebra, Boolean Algorithms Combinatorial optimization Computational complexity Computer algorithms Computer programming Computer science Computer scienceMathematics Computer scienceStatistical methods Computer software Conrad, Joseph, Constraints (Artificial intelligence) Differential equations, Nonlinear Electronic data processing Trees (Graph theory)