default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKent Quanrud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c31]Kent Quanrud:
Adaptive Sparsification for Matroid Intersection. ICALP 2024: 118:1-118:20- [c30]Kent Quanrud:
Faster exact and approximation algorithms for packing and covering matroids via push-relabel. SODA 2024: 2305-2336 - [c29]Chandra Chekuri
, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn:
Adaptive Out-Orientations with Applications. SODA 2024: 3062-3088 - [c28]Kent Quanrud:
Quotient sparsification for submodular functions. SODA 2024: 5209-5248 - [i27]Yufan Huang, Peter Jin, Kent Quanrud:
Faster single-source shortest paths with negative real weights via proper hop distance. CoRR abs/2407.04872 (2024) - 2023
- [c27]Chandra Chekuri, Kent Quanrud:
Independent Sets in Elimination Graphs with a Submodular Objective. APPROX/RANDOM 2023: 24:1-24:22 - [c26]Elfarouk Harb, Kent Quanrud, Chandra Chekuri:
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. ESA 2023: 56:1-56:17 - [i26]Kent Quanrud:
Faster exact and approximation algorithms for packing and covering matroids via push-relabel. CoRR abs/2303.01478 (2023) - [i25]Elfarouk Harb, Kent Quanrud, Chandra Chekuri:
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. CoRR abs/2305.02987 (2023) - [i24]Chandra Chekuri, Kent Quanrud:
Independent Sets in Elimination Graphs with a Submodular Objective. CoRR abs/2307.02022 (2023) - [i23]Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn:
Adaptive Out-Orientations with Applications. CoRR abs/2310.18146 (2023) - [i22]Richard Li, Kent Quanrud:
Approximate Fully Dynamic Directed Densest Subgraph. CoRR abs/2312.07827 (2023) - 2022
- [j5]Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi R. Varadarajan, Zhao Zhang:
Algorithms for covering multiple submodular constraints and applications. J. Comb. Optim. 44(2): 979-1010 (2022) - [j4]Kent Quanrud:
Fast and Deterministic Approximations for k-Cut. Theory Comput. 18: 1-24 (2022) - [c25]Elfarouk Harb, Kent Quanrud, Chandra Chekuri:
Faster and Scalable Algorithms for Densest Subgraph and Decomposition. NeurIPS 2022 - [c24]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. SODA 2022: 1531-1555 - [i21]Chandra Chekuri, Kent Quanrud:
(1-ε)-approximate fully dynamic densest subgraph: linear space and faster update time. CoRR abs/2210.02611 (2022) - 2021
- [c23]Elena Grigorescu, Young-San Lin, Kent Quanrud:
Online Directed Spanners and Steiner Forests. APPROX-RANDOM 2021: 5:1-5:25 - [c22]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. APPROX-RANDOM 2021: 24:1-24:21 - [c21]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Kent Quanrud:
Minimum Cuts in Directed Graphs via Partial Sparsification. FOCS 2021: 1147-1158 - [c20]Chandra Chekuri, Kent Quanrud:
Faster Algorithms for Rooted Connectivity in Directed Graphs. ICALP 2021: 49:1-49:16 - [c19]Chandra Chekuri, Kent Quanrud:
Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity. ICALP 2021: 50:1-50:20 - [c18]Kent Quanrud:
Spectral Sparsification of Metrics and Kernels. SODA 2021: 1445-1464 - [i20]Elena Grigorescu, Young-San Lin, Kent Quanrud:
Online Directed Spanners and Steiner Forests. CoRR abs/2103.04543 (2021) - [i19]Chandra Chekuri, Kent Quanrud:
Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems. CoRR abs/2103.12908 (2021) - [i18]Kent Quanrud:
Fast Approximations for Rooted Connectivity in Weighted Directed Graphs. CoRR abs/2104.06933 (2021) - [i17]Chandra Chekuri, Kent Quanrud:
Faster Algorithms for Rooted Connectivity in Directed Graphs. CoRR abs/2104.07205 (2021) - [i16]Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak:
Minimum Cuts in Directed Graphs via Partial Sparsification. CoRR abs/2111.08959 (2021) - 2020
- [j3]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
ℓ 1-Sparsity approximation bounds for packing integer programs. Math. Program. 183(1): 195-214 (2020) - [j2]Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-Cut. SIAM J. Discret. Math. 34(2): 1334-1353 (2020) - [c17]Kent Quanrud:
Nearly linear time approximations for mixed packing and covering problems without data structures or randomization. SOSA 2020: 69-80 - [c16]Chandra Chekuri, Sariel Har-Peled, Kent Quanrud:
Fast LP-based Approximations for Geometric Packing and Covering Problems. SODA 2020: 1019-1038 - [c15]Sally Dong, Yin Tat Lee, Kent Quanrud:
Computing Circle Packing Representations of Planar Graphs. SODA 2020: 2860-2875 - [i15]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. CoRR abs/2011.03194 (2020)
2010 – 2019
- 2019
- [b1]Kent Quanrud:
Fast approximations for combinatorial optimization via multiplicative weight updates. University of Illinois Urbana-Champaign, USA, 2019 - [c14]Kent Quanrud:
Fast and Deterministic Approximations for k-Cut. APPROX-RANDOM 2019: 23:1-23:20 - [c13]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
\ell _1 -sparsity Approximation Bounds for Packing Integer Programs. IPCO 2019: 128-140 - [c12]Kent Quanrud:
Approximating Optimal Transport With Linear Programs. SOSA 2019: 6:1-6:9 - [c11]Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-cuts. SOSA 2019: 7:1-7:18 - [c10]Chandra Chekuri, Kent Quanrud:
Submodular Function Maximization in Parallel via the Multilinear Relaxation. SODA 2019: 303-322 - [c9]Chandra Chekuri, Kent Quanrud:
On Approximating (Sparse) Covering Integer Programs. SODA 2019: 1596-1615 - [c8]Chandra Chekuri, Kent Quanrud:
Parallelizing greedy for submodular set function maximization in matroids and beyond. STOC 2019: 78-89 - [i14]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
$\ell_1$-sparsity Approximation Bounds for Packing Integer Programs. CoRR abs/1902.08698 (2019) - [i13]Chandra Chekuri, Kent Quanrud, Zhao Zhang:
On Approximating Partial Set Cover and Generalizations. CoRR abs/1907.04413 (2019) - [i12]Sally Dong, Yin Tat Lee, Kent Quanrud:
Computing Circle Packing Representations of Planar Graphs. CoRR abs/1911.00612 (2019) - 2018
- [c7]Chandra Chekuri, Kent Quanrud:
Randomized MWU for Positive LPs. SODA 2018: 358-377 - [i11]Chandra Chekuri, Kent Quanrud:
Fast Approximations for Metric-TSP via Linear Programming. CoRR abs/1802.01242 (2018) - [i10]Kent Quanrud:
Fast and Deterministic Approximations for k-Cut. CoRR abs/1807.07143 (2018) - [i9]Chandra Chekuri, Kent Quanrud:
Submodular Function Maximization in Parallel via the Multilinear Relaxation. CoRR abs/1807.08678 (2018) - [i8]Chandra Chekuri, Kent Quanrud:
On Approximating (Sparse) Covering Integer Programs. CoRR abs/1807.11538 (2018) - [i7]Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-cuts. CoRR abs/1808.05765 (2018) - [i6]Kent Quanrud:
Approximating optimal transport with linear programs. CoRR abs/1810.05957 (2018) - [i5]Chandra Chekuri, Kent Quanrud:
Parallelizing greedy for submodular set function maximization in matroids and beyond. CoRR abs/1811.12568 (2018) - 2017
- [j1]Sariel Har-Peled, Kent Quanrud:
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. SIAM J. Comput. 46(6): 1712-1744 (2017) - [c6]Chandra Chekuri, Kent Quanrud:
Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. FOCS 2017: 789-800 - [c5]Chandra Chekuri, Kent Quanrud:
Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems. SODA 2017: 801-820 - [i4]Chandra Chekuri, Kent Quanrud:
Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. CoRR abs/1702.04307 (2017) - 2016
- [c4]Chandra Chekuri, Kent Quanrud:
A Fast Approximation for Maximum Weight Matroid Intersection. SODA 2016: 445-457 - [i3]Sariel Har-Peled, Kent Quanrud:
Notes on Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. CoRR abs/1603.03098 (2016) - 2015
- [c3]Sariel Har-Peled, Kent Quanrud:
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs. ESA 2015: 717-728 - [c2]Chandra Chekuri, Shalmoli Gupta, Kent Quanrud:
Streaming Algorithms for Submodular Function Maximization. ICALP (1) 2015: 318-330 - [c1]Kent Quanrud, Daniel Khashabi:
Online Learning with Adversarial Delays. NIPS 2015: 1270-1278 - [i2]Sariel Har-Peled, Kent Quanrud:
Approximation Algorithms for Low-Density Graphs. CoRR abs/1501.00721 (2015) - [i1]Chandra Chekuri, Shalmoli Gupta, Kent Quanrud:
Streaming Algorithms for Submodular Function Maximization. CoRR abs/1504.08024 (2015)
Coauthor Index
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-10-07 21:13 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:
