default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmit Kumar 0001
- > Home > Persons > Amit Kumar 0001
Publications
- 2023
[j30]Jatin Batra, Naveen Garg, Amit Kumar:
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time. SIAM J. Comput. 52(6): S18-158 (2023)- 2021
- [c85]Naveen Garg, Sanjeev Khanna, Amit Kumar:
Hardness of Approximation for Orienteering with Multiple Time Windows. SODA 2021: 2977-2990 - 2019
- [c77]Naveen Garg
, Anupam Gupta, Amit Kumar, Sahil Singla:
Non-Clairvoyant Precedence Constrained Scheduling. ICALP 2019: 63:1-63:14 - [i23]Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla:
Non-clairvoyant Precedence Constrained Scheduling. CoRR abs/1905.02133 (2019) - 2018
- [j25]Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar:
Rejecting jobs to minimize load and maximum flow-time. J. Comput. Syst. Sci. 91: 42-68 (2018) - [c74]Jatin Batra, Naveen Garg, Amit Kumar:
Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time. FOCS 2018: 778-789 - [i19]Jatin Batra, Naveen Garg, Amit Kumar:
Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-polynomial time. CoRR abs/1802.07439 (2018) - 2017
- [j23]S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica 77(2): 515-536 (2017) - 2015
- [c61]Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, Andreas Wiese:
New Approximation Schemes for Unsplittable Flow on a Path. SODA 2015: 47-58 - [c60]Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar:
Rejecting jobs to Minimize Load and Maximum Flow-time. SODA 2015: 1114-1133 - 2014
- [i10]Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar:
Rejecting Jobs to Minimize Load and Maximum Flow-time. CoRR abs/1410.1839 (2014) - 2013
- [c55]S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. ICALP (1) 2013: 13-24 - 2012
- [c50]Khaled M. Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula, Arindam Pal:
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. FSTTCS 2012: 267-275 - [c48]S. Anand, Naveen Garg, Amit Kumar:
Resource augmentation for weighted flow-time explained by dual fitting. SODA 2012: 1228-1241 - 2010
- [j16]Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre:
Assigning Papers to Referees. Algorithmica 58(1): 119-136 (2010) - 2009
- [c38]Jivitej S. Chadha, Naveen Garg, Amit Kumar, V. N. Muralidhara:
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation. STOC 2009: 679-684 - 2008
- [c35]Naveen Garg, Amit Kumar, V. N. Muralidhara:
Minimizing Total Flow-Time: The Unrelated Case. ISAAC 2008: 424-435 - 2007
- [c31]Naveen Garg, Amit Kumar:
Minimizing Average Flow-time : Upper and Lower Bounds. FOCS 2007: 603-613 - [c29]Naveen Garg, Amit Kumar, Vinayaka Pandit:
Order Scheduling Models: Hardness and Algorithms. FSTTCS 2007: 96-107 - 2006
- [c27]Naveen Garg, Amit Kumar:
Better Algorithms for Minimizing Average Flow-Time on Related Machines. ICALP (1) 2006: 181-190 - [c26]Naveen Garg, Amit Kumar:
Minimizing average flow time on related machines. STOC 2006: 730-738
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-19 00:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
