The following pages link to Kasturi R. Varadarajan (Q590541):
Displaying 50 items.
- (Q228676) (redirect page) (← links)
- (Q441887) (redirect page) (← links)
- The planar \(k\)-means problem is NP-hard (Q441888) (← links)
- Optimally decomposing coverings with translates of a convex polygon (Q635757) (← links)
- Efficient subspace approximation algorithms (Q664540) (← links)
- Approximation algorithms for a \(k\)-line center (Q818652) (← links)
- Improved approximation algorithms for geometric set cover (Q866970) (← links)
- The complexity of equilibria: Hardness results for economies via a correspondence with games (Q959811) (← links)
- On metric clustering to minimize the sum of radii (Q970610) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center (Q1405006) (← links)
- Facility location on a polyhedral surface (Q1434248) (← links)
- High-dimensional shape fitting in linear time (Q1762950) (← links)
- Efficient algorithms for approximating polygonal chains (Q1971509) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- Fault tolerant clustering with outliers (Q2193092) (← links)
- Improved approximation bounds for the minimum constraint removal problem (Q2206735) (← links)
- Fault-tolerant covering problems in metric spaces (Q2659766) (← links)
- Approximating Shortest Paths on a Nonconvex Polyhedron (Q2706111) (← links)
- (Q2768379) (← links)
- Weighted geometric set cover via quasi-uniform sampling (Q2875191) (← links)
- On Clustering to Minimize the Sum of Radii (Q2884573) (← links)
- Computing Regions Decomposable into m Stars (Q2921434) (← links)
- (Q2921655) (← links)
- (Q2934635) (← links)
- (Q2957523) (← links)
- Guarding terrains via local search (Q2968116) (← links)
- A constant-factor approximation for multi-covering with disks (Q2970422) (← links)
- On isolating points using unit disks (Q2970462) (← links)
- Approximating extent measures of points (Q3069903) (← links)
- On Isolating Points Using Disks (Q3092217) (← links)
- (Q3132847) (← links)
- Max-coloring and online coloring with bandwidths on interval graphs (Q3189018) (← links)
- A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) (Q3192003) (← links)
- On the Approximability of Orthogonal Order Preserving Layout Adjustment (Q3449805) (← links)
- On Metric Clustering to Minimize the Sum of Radii (Q3512466) (← links)
- (Q3524715) (← links)
- Sampling-based dimension reduction for subspace approximation (Q3549665) (← links)
- (Q3579384) (← links)
- Market equilibrium via the excess demand function (Q3581416) (← links)
- Leontief economies encode nonzero sum two-player games (Q3581585) (← links)
- The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
- Computing Equilibrium Prices in Exchange Economies with Tax Distortions (Q3613792) (← links)
- An Approximation Scheme for Terrain Guarding (Q3638874) (← links)
- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs (Q3638887) (← links)
- (Q4252363) (← links)
- Approximating shortest paths on a convex polytope in three dimensions (Q4377587) (← links)
- (Q4411345) (← links)
- Projective clustering in high dimensions using core-sets (Q4557567) (← links)
