The following pages link to Sanjeev Khanna (Q178479):
Displaying 50 items.
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- On the complexity of graph self-assembly in accretive systems (Q934978) (← links)
- Robust self-assembly of graphs (Q968405) (← links)
- (Q1393081) (redirect page) (← links)
- On certificates and lookahead in dynamic graph problems (Q1393083) (← links)
- Time-constrained scheduling of weighted packets on trees and meshes (Q1400890) (← links)
- On indexed data broadcast (Q1577012) (← links)
- A linear time algorithm for sequential diagnosis in hypercubes (Q1892860) (← links)
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling (Q2039246) (← links)
- Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs (Q2322505) (← links)
- Approximability of capacitated network design (Q2354026) (← links)
- The network as a storage device: dynamic routing with bounded buffers (Q2391188) (← links)
- A greedy approximation algorithm for minimum-gap scheduling (Q2400437) (← links)
- The approximability of constraint satisfaction problems (Q2706139) (← links)
- Complexity classifications of Boolean constraint satisfaction problems (Q2723175) (← links)
- Approximation algorithms for the metric labeling problem via a new linear programming formulation (Q2768280) (← links)
- A deterministic algorithm for the cost-distance problem (Q2768299) (← links)
- Design networks with bounded pairwise distance (Q2819606) (← links)
- Distributed Private Heavy Hitters (Q2843272) (← links)
- Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs (Q2848226) (← links)
- The all-or-nothing multicommodity flow problem (Q2862199) (← links)
- Perfect matchings in \(O(n \log n)\) time in regular bipartite graphs (Q2875130) (← links)
- An \(O(k^3\log n)\)-approximation algorithm for vertex-connectivity survivable network design (Q2913818) (← links)
- Approximating the average response time in broadcast scheduling (Q2921673) (← links)
- Approximation algorithms for data placement on parallel disks (Q2930259) (← links)
- Perfect matchings via uniform sampling in regular bipartite graphs (Q2930303) (← links)
- Hardness of cut problems in directed graphs (Q2931415) (← links)
- Edge-disjoint paths in Planar graphs with constant congestion (Q2931436) (← links)
- On the Power of Adversarial Infections in Networks (Q2938012) (← links)
- Strategic Network Formation with Attack and Immunization (Q2959849) (← links)
- (Q3002769) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (Q3088084) (← links)
- Social Welfare in One-Sided Matching Markets without Money (Q3088085) (← links)
- STCON in Directed Unique-Path Graphs (Q3165964) (← links)
- Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply (Q3167386) (← links)
- Polynomial flow-cut gaps and hardness of directed cut problems (Q3452200) (← links)
- Fast Convergence in the Double Oral Auction (Q3460777) (← links)
- Algorithms for 2-Route Cut Problems (Q3521941) (← links)
- Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data (Q3524310) (← links)
- Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate (Q3546291) (← links)
- (Q3549611) (← links)
- (Q3549612) (← links)
- (Q3549697) (← links)
- Approximation schemes for preemptive weighted flow time (Q3579232) (← links)
- Asymmetric k-center is log <sup>*</sup> <i>n</i> -hard to approximate (Q3580956) (← links)
- The all-or-nothing multicommodity flow problem (Q3580965) (← links)
- Multi-processor scheduling to minimize flow time with ε resource augmentation (Q3580981) (← links)
- Multicommodity flow, well-linked terminals, and routing problems (Q3581391) (← links)