Searching for authors named "Sanjeev Khanna" – sorted by Relevance.
-
A Polynomial Time Approximation Scheme for the SONET Ring Loading Problem
- A Polynomial Time Approximation Scheme for the SONET Ring Loading Problem Sanjeev Khanna
- Cited by 8 (0 self) – Add To MetaCart
-
The Optimization Complexity of Constraint Satisfaction Problems
- The Optimization Complexity of Constraint Satisfaction Problems Sanjeev Khanna Madhu Sudan y
- Cited by 6 (3 self) – Add To MetaCart
-
On computing functions with uncertainty
- On Computing Functions with Uncertainty Sanjeev Khanna University of Pennsylvania sanjeev
- Cited by 15 (0 self) – Add To MetaCart
-
A Structural View Of Approximation
- FOR THE DEGREE OF DOCTOR OF PHILOSOPHY By Sanjeev Khanna August c fl Copyright 1996 by Sanjeev Khanna All Rights
- Add To MetaCart
-
Watermarking Maps: Hiding Information in Structured Data
- Watermarking Maps: Hiding Information in Structured Data Sanjeev Khanna Francis Zane y
- Cited by 4 (0 self) – Add To MetaCart
-
On Wireless Spectrum Estimation and Generalized Graph Coloring
- 1 On Wireless Spectrum Estimation and Generalized Graph Coloring Sanjeev Khanna Krishnan Kumaran
- Cited by 12 (0 self) – Add To MetaCart
-
Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems
- Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems ∗ Julia Chuzhoy † Sanjeev Khanna
- Cited by 1 (0 self) – Add To MetaCart
-
Space-Time Tradeoffs for Graph Properties
- Space-Time Tradeoffs for Graph Properties Yevgeniy Dodis Sanjeev Khanna y Abstract We
- Cited by 6 (0 self) – Add To MetaCart
-
New hardness results for undirected edge disjoint paths
- New Hardness Results for Undirected Edge Disjoint Paths Julia Chuzhoy* Sanjeev Khanna# July
- Cited by 1 (0 self) – Add To MetaCart
-
Hardness of Routing with Congestion in Directed Graphs
- of Mathematics Institute for Advanced Study Princeton, NJ 08540 cjulia@(email omitted); Sanjeev Khanna ‡ Dept
- Cited by 1 (1 self) – Add To MetaCart

