Kent Quanrud

Available identifiers

zbMath Open quanrud.kentMaRDI QIDQ2165260

List of research outcomes

Publication	Date of Publication	Type
Independent sets in elimination graphs with a submodular objective	2025-01-14	Paper
Convergence to lexicographically optimal base in a (contra)polymatroid and applications to densest subgraph and tree packing	2025-01-06	Paper
Faster exact and approximation algorithms for packing and covering matroids via push-relabel	2024-11-28	Paper
Adaptive out-orientations with applications	2024-11-28	Paper
Quotient sparsification for submodular functions	2024-11-28	Paper
Approximating optimal transport with linear programs	2024-08-26	Paper
LP relaxation and tree packing for minimum \(k\)-cuts	2024-08-26	Paper
Densest subgraph: supermodularity, iterative peeling, and flow	2024-07-19	Paper
Nearly linear time approximations for mixed packing and covering problems without data structures or randomization	2024-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q6147342	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6090899	2023-11-20	Paper
Online Directed Spanners and Steiner Forests.	2023-11-20	Paper
Fast and Deterministic Approximations for k-Cut.	2023-02-03	Paper
Algorithms for covering multiple submodular constraints and applications	2022-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q5077149	2022-05-18	Paper
Fast LP-based Approximations for Geometric Packing and Covering Problems	2021-02-02	Paper
Computing Circle Packing Representations of Planar Graphs	2021-02-02	Paper
\(\ell_1\)-sparsity approximation bounds for packing integer programs	2020-08-28	Paper
LP Relaxation and Tree Packing for Minimum $k$-Cut	2020-07-30	Paper
\(\ell_1\)-sparsity approximation bounds for packing integer programs	2020-02-06	Paper
Parallelizing greedy for submodular set function maximization in matroids and beyond	2020-01-30	Paper
Submodular Function Maximization in Parallel via the Multilinear Relaxation	2019-10-15	Paper
On Approximating (Sparse) Covering Integer Programs	2019-10-15	Paper
Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems	2018-07-16	Paper
A Fast Approximation for Maximum Weight Matroid Intersection	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4607903	2018-03-15	Paper
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs	2017-11-22	Paper
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs	2015-11-19	Paper
Streaming Algorithms for Submodular Function Maximization	2015-10-27	Paper

Research outcomes over time

This page was built for person: Kent Quanrud