Naveen Garg

From MaRDI portal
Person:293208

Available identifiers

zbMath Open garg.naveen-kumarWikidataQ27947608 ScholiaQ27947608MaRDI QIDQ293208

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61474352024-01-15Paper
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time2023-12-19Paper
Locating service and charging stations2023-07-25Paper
https://portal.mardi4nfdi.de/entity/Q58745262023-02-07Paper
Integer plane multiflow maximisation: one-quarter-approximation and gaps2022-10-24Paper
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation2022-10-14Paper
Fair Division of Indivisible Goods for a Class of Concave Valuations2022-08-02Paper
https://portal.mardi4nfdi.de/entity/Q50909602022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50909612022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50912202022-07-21Paper
Semi-discrete central-upwind Rankine-Hugoniot schemes for hyperbolic systems of conservation laws2022-04-21Paper
Godunov-type schemes for the pressureless gas dynamics and related models2022-01-27Paper
Parallel Machine Scheduling to Minimize Energy Consumption2021-02-02Paper
Fifth-Order A-WENO Finite-Difference Schemes Based on a New Adaptive Diffusion Central Numerical Flux2021-01-29Paper
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time2020-10-26Paper
A class of upwind methods based on generalized eigenvectors for weakly hyperbolic systems2020-02-20Paper
A 4/3-approximation for TSP on cubic 3-edge-connected graphs2019-06-11Paper
Multiway cuts in directed and node weighted graphs2019-04-29Paper
Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover2019-03-29Paper
Rejecting jobs to minimize load and maximum flow-time2017-10-11Paper
Rejecting jobs to Minimize Load and Maximum Flow-time2017-10-05Paper
New Approximation Schemes for Unsplittable Flow on a Path2017-10-05Paper
https://portal.mardi4nfdi.de/entity/Q29575042017-01-26Paper
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane2016-09-01Paper
The \(p\)-neighbor \(k\)-center problem2016-06-09Paper
Approximate max-flow min-(multi)cut theorems and their applications2015-05-07Paper
Local search heuristic for k-median and facility location problems2015-02-27Paper
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation2015-02-04Paper
Minimizing average flow time on related machines2014-11-25Paper
https://portal.mardi4nfdi.de/entity/Q29217642014-10-13Paper
A 3-approximation algorithm for the facility location problem with uniform capacities2013-11-11Paper
A 5-Approximation for Capacitated Facility Location2012-09-25Paper
Assigning papers to referees2010-10-07Paper
Saving an epsilon2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35793862010-08-06Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques2010-05-26Paper
Algorithms - ESA 20032010-03-03Paper
Minimizing Average Flow-Time2009-11-12Paper
Better Algorithms for Minimizing Average Flow-Time on Related Machines2009-03-12Paper
Minimizing Total Flow-Time: The Unrelated Case2009-01-29Paper
Order Scheduling Models: Hardness and Algorithms2008-04-24Paper
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems2008-04-22Paper
Minimizing stall time in single and parallel disk systems2006-09-12Paper
Milling bifurcations from structural asymmetry and nonlinear regeneration2006-08-14Paper
Algorithms – ESA 20052006-06-27Paper
Algorithms – ESA 20042005-08-18Paper
Local Search Heuristics for k-Median and Facility Location Problems2005-02-21Paper
Min-max tree covers of graphs.2005-01-11Paper
Multiway cuts in node weighted graphs2004-10-04Paper
https://portal.mardi4nfdi.de/entity/Q44713382004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q45425642004-01-27Paper
Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks2003-02-19Paper
https://portal.mardi4nfdi.de/entity/Q45377442002-06-20Paper
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem2000-11-05Paper
https://portal.mardi4nfdi.de/entity/Q45016732000-09-04Paper
On the single-source unsplittable flow problem1999-12-08Paper
Finding Separator Cuts in Planar Graphs within Twice the Optimal1999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42501891999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42341491999-03-16Paper
https://portal.mardi4nfdi.de/entity/Q31288821997-11-18Paper
An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane1997-05-29Paper
Primal-dual approximation algorithms for integral flow and multicut in trees1997-05-28Paper
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications1996-05-13Paper
A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts1996-02-01Paper
https://portal.mardi4nfdi.de/entity/Q31404081994-01-02Paper
Symmetrization of matrix technique in a finite element context1985-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Naveen Garg