The following pages link to Naveen Garg (Q293208):
Displayed 50 items.
- The \(p\)-neighbor \(k\)-center problem (Q293209) (← links)
- A 3-approximation algorithm for the facility location problem with uniform capacities (Q378101) (← links)
- (Q679442) (redirect page) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
- Min-max tree covers of graphs. (Q703232) (← links)
- (Q1081286) (redirect page) (← links)
- Symmetrization of matrix technique in a finite element context (Q1081288) (← links)
- On the single-source unsplittable flow problem (Q1125608) (← links)
- Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks (Q1859453) (← links)
- A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts (Q1904657) (← links)
- Assigning papers to referees (Q1959732) (← links)
- Godunov-type schemes for the pressureless gas dynamics and related models (Q2073069) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
- Semi-discrete central-upwind Rankine-Hugoniot schemes for hyperbolic systems of conservation laws (Q2128355) (← links)
- A class of upwind methods based on generalized eigenvectors for weakly hyperbolic systems (Q2299216) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- A 4/3-approximation for TSP on cubic 3-edge-connected graphs (Q2417175) (← links)
- Milling bifurcations from structural asymmetry and nonlinear regeneration (Q2499510) (← links)
- An <i>O</i>(log <i>k</i>) approximation algorithm for the <i>k</i> minimum spanning tree problem in the plane (Q2817634) (← links)
- A 5-Approximation for Capacitated Facility Location (Q2912835) (← links)
- (Q2921764) (← links)
- Minimizing average flow time on related machines (Q2931433) (← links)
- Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees (Q2957504) (← links)
- (Q3128882) (← links)
- (Q3140408) (← links)
- (Q3579386) (← links)
- Saving an epsilon (Q3581401) (← links)
- Minimizing Total Flow-Time: The Unrelated Case (Q3596738) (← links)
- Better Algorithms for Minimizing Average Flow-Time on Related Machines (Q3613759) (← links)
- Minimizing Average Flow-Time (Q3644722) (← links)
- (Q4234149) (← links)
- (Q4250189) (← links)
- Finding Separator Cuts in Planar Graphs within Twice the Optimal (Q4268875) (← links)
- (Q4471338) (← links)
- (Q4501673) (← links)
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem (Q4512573) (← links)
- (Q4537744) (← links)
- (Q4542564) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
- Multiway cuts in directed and node weighted graphs (Q4632450) (← links)
- Local Search Heuristics for <i>k</i>-Median and Facility Location Problems (Q4651480) (← links)
- Multiway cuts in node weighted graphs (Q4819693) (← links)
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications (Q4877516) (← links)
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
- (Q5090960) (← links)
- On fair division for indivisible items (Q5090961) (← links)
- Non-Clairvoyant Precedence Constrained Scheduling. (Q5091220) (← links)
- Fair Division of Indivisible Goods for a Class of Concave Valuations (Q5094007) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q5129231) (← links)