The following pages link to Sudipto Guha (Q1009267):
Displayed 50 items.
- Sketching information divergences (Q1009269) (← links)
- Facility location with dynamic distance functions (Q1282205) (← links)
- (Q1386344) (redirect page) (← links)
- Approximation algorithms for connected dominating sets (Q1386346) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- Cure: An efficient clustering algorithm for large databases (Q1860260) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- Linear programming in the semi-streaming model with application to the maximum matching problem (Q1951572) (← links)
- Correlation clustering in data streams (Q2037102) (← links)
- (Q2768358) (← links)
- Approximating the Throughput of Multiple Machines in Real-Time Scheduling (Q2784456) (← links)
- A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) (Q2819529) (← links)
- Efficient recovery from power outage (extended abstract) (Q2819589) (← links)
- Approximating the throughput of multiple machines under real-time scheduling (Q2819592) (← links)
- Spectral Sparsification in Dynamic Graph Streams (Q2851844) (← links)
- Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback (Q2851857) (← links)
- Sublinear estimation of entropy and information distances (Q2930260) (← links)
- (Q2934609) (← links)
- Approximation algorithms for restless bandit problems (Q2999784) (← links)
- Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (Q3012945) (← links)
- How to probe for an extreme value (Q3188994) (← links)
- Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems (Q3189041) (← links)
- Improved approximations of crossings in graph drawings (Q3191996) (← links)
- Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination (Q3521964) (← links)
- Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate (Q3546291) (← links)
- (Q3549602) (← links)
- Asymmetric k-center is log <sup>*</sup> <i>n</i> -hard to approximate (Q3580956) (← links)
- Approximation algorithms for wavelet transform coding of data streams (Q3581505) (← links)
- Streaming and sublinear approximation of entropy and information distances (Q3581507) (← links)
- Approximation Algorithms for Wavelet Transform Coding of Data Streams (Q3604575) (← links)
- Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams (Q3638059) (← links)
- Graph Sparsification in the Semi-streaming Model (Q3638103) (← links)
- Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams (Q3642875) (← links)
- A Constant Factor Approximation for the Single Sink Edge Installation Problem (Q3654382) (← links)
- Greedy Strikes Back: Improved Facility Location Algorithms (Q4240134) (← links)
- (Q4247267) (← links)
- (Q4250182) (← links)
- (Q4250234) (← links)
- (Q4395328) (← links)
- (Q4449175) (← links)
- Capacitated vertex covering (Q4458880) (← links)
- A constant factor approximation algorithm for the fault-tolerant facility location problem (Q4458888) (← links)
- Message Multicasting in Heterogeneous Networks (Q4507354) (← links)
- (Q4542528) (← links)
- (Q4542563) (← links)
- Approximation algorithms for connected dominating sets (Q4595486) (← links)
- (Q4633808) (← links)
- Learning Theory (Q4680876) (← links)
- Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas (Q4706191) (← links)
- (Q4828921) (← links)