The following pages link to Rajeev Motwani (Q6480591):
Displaying 50 items.
- On approximating the longest path in a graph (Q679451) (← links)
- (Q878746) (redirect page) (← links)
- The price of validity in dynamic networks (Q878747) (← links)
- Covering orthogonal polygons with star polygons: The perfect graph approach (Q918225) (← links)
- Finding large cycles in Hamiltonian graphs (Q972323) (← links)
- On the graph turnpike problem (Q989483) (← links)
- A combinatorial algorithm for MAX CSP (Q1007550) (← links)
- The greedy algorithm is optimal for on-line edge coloring (Q1209350) (← links)
- Randomized query processing in robot path planning (Q1273861) (← links)
- Approximating probability distributions using small sample spaces (Q1288906) (← links)
- Nonclairvoyant scheduling (Q1331961) (← links)
- Computing roots of graphs is hard (Q1336641) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- On certificates and lookahead in dynamic graph problems (Q1393083) (← links)
- Modeling correlations in web traces and implications for designing replacement policies (Q1886610) (← links)
- Combining request scheduling with web caching (Q1887085) (← links)
- Combinatorial and experimental methods for approximate point pattern matching (Q1889585) (← links)
- Clique partitions, graph compression and speeding-up algorithms (Q1900930) (← links)
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
- Scale-free aggregation in sensor networks (Q2575090) (← links)
- Approximation techniques for average completion time scheduling (Q2719134) (← links)
- Derandomization through approximation, an NC algorithm for minimum cuts (Q2817641) (← links)
- Complexity of graph partition problems (Q2819579) (← links)
- Approximate nearest neighbor: towards removing the curse of dimensionality (Q2913814) (← links)
- Finding large cycles in Hamiltonian graphs (Q2921667) (← links)
- Querying priced information in databases (Q2944545) (← links)
- (Q3138917) (← links)
- Non-clairvoyant scheduling (Q3140446) (← links)
- Approximating the Longest Cycle Problem in Sparse Graphs (Q3149885) (← links)
- Proof verification and the hardness of approximation problems (Q3158513) (← links)
- Online graph edge-coloring in the random-order arrival model (Q3191564) (← links)
- On the decidability of accessibility problems (extended abstract) (Q3191998) (← links)
- Finding long paths and cycles in sparse Hamiltonian graphs (Q3192021) (← links)
- Computing the median with uncertainty (Q3192032) (← links)
- Computing shortest paths with uncertainty (Q3437091) (← links)
- Lower Bounds on Locality Sensitive Hashing (Q3544242) (← links)
- Fractional Matching Via Balls-and-Bins (Q3595378) (← links)
- (Q3601534) (← links)
- Deferred Data Structuring (Q3813273) (← links)
- Perfect Graphs and Orthogonally Convex Covers (Q3828050) (← links)
- Approximate graph coloring by semidefinite programming (Q3841651) (← links)
- A Linear Time Approach to the Set Maxima Problem (Q3989007) (← links)
- Realization of Matrices and Directed Graphs (Q4209274) (← links)
- On Syntactic versus Computational Views of Approximability (Q4210142) (← links)
- An overview of randomized algorithms (Q4226450) (← links)
- The difference between a graph and its square (Q4228228) (← links)
- Towards and syntactic characterization of PTAS (Q4228486) (← links)
- Proof verification and hardness of approximation problems (Q4230322) (← links)
- (Q4234082) (← links)
- (Q4250208) (← links)
