:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Brown, Adam, Laddha, Aditi, Singh, Mohit
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2401.14317
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
by: Brown, Adam, et al.
Published: (2024)

A Poisson Process for Submodular Maximization
by: Rozenman, Amit Ganz, et al.
Published: (2026)

Reducing Isotropy and Volume to KLS: Faster Rounding and Volume Algorithms
by: Jia, He, et al.
Published: (2020)

Faster Global Minimum Cut with Predictions
by: Moseley, Benjamin, et al.
Published: (2025)

The Cost of Consistency: Submodular Maximization with Constant Recourse
by: Dütting, Paul, et al.
Published: (2024)

A Note on Rounding Matchings in General Graphs
by: Dudeja, Aditi
Published: (2024)

Approximation Algorithms for D-optimal Design
by: Singh, Mohit, et al.
Published: (2018)

Tight Sampling Bounds for Eigenvalue Approximation
by: Swartworth, William, et al.
Published: (2024)

Distributed Sparsest Cut via Eigenvalue Estimation
by: Maus, Yannic, et al.
Published: (2025)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
by: DeHaan, Ian, et al.
Published: (2025)

A Weighted-to-Unweighted Reduction for Matroid Intersection
by: Dudeja, Aditi, et al.
Published: (2026)

Constant sensitivity on the CDAWGs
by: Hamai, Rikuya, et al.
Published: (2025)

Computing Experiment-Constrained D-Optimal Designs
by: Pillai, Aditya, et al.
Published: (2024)

Width Parameters for Minimum Flow Decomposition
by: Grigorjew, Andreas, et al.
Published: (2024)

Faster Pseudo-Deterministic Minimum Cut
by: Kenneth-Mordoch, Yotam
Published: (2026)

Minimum Temporal Spanners in Happy Graphs
by: Casteigts, Arnaud, et al.
Published: (2026)

Minimum $s$--$t$ Cuts with Fewer Cut Queries
by: Jiang, Yonggang, et al.
Published: (2025)

Thin Trees for Near Minimum Cuts
by: Klein, Nathan, et al.
Published: (2026)

Exact Optimization for Minimum Dominating Sets
by: Zhu, Enqiang, et al.
Published: (2025)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
by: Daga, Mohit
Published: (2025)

Constant-Stretch Rounding on the Hypersimplex
by: Anari, Nima, et al.
Published: (2026)

Learning Minimum Linear Arrangement of Cliques and Lines
by: Dallot, Julien, et al.
Published: (2024)

Parameterized Algorithms for Minimum Sum Vertex Cover
by: Aute, Shubhada, et al.
Published: (2024)

Simple Length-Constrained Minimum Spanning Trees
by: Hershkowitz, D Ellis, et al.
Published: (2024)

Planar Length-Constrained Minimum Spanning Trees
by: Hershkowitz, D Ellis, et al.
Published: (2025)

Connectivity-Preserving Minimum Separator in AT-free Graphs
by: Kenig, Batya
Published: (2025)

Improving Pinwheel Density Bounds for Small Minimums
by: Mishra, Ahan, et al.
Published: (2025)

Near-Optimal Minimum Cuts in Hypergraphs at Scale
by: Chhabra, Adil, et al.
Published: (2025)

Minimum-Peak-Cost Flows Over Time
by: Anapolska, Mariia, et al.
Published: (2025)

Edge-Minimum Walk of Modular Length in Polynomial Time
by: Amarilli, Antoine, et al.
Published: (2024)

Minimum sum vertex cover: kernelization and parameterized algorithms
by: Cao, Yixin, et al.
Published: (2024)

Stochastic Minimum Spanning Trees with a Single Sample
by: Hoeksma, Ruben, et al.
Published: (2024)

Cactus Representation of Minimum Cuts: Derandomize and Speed up
by: He, Zhongtian, et al.
Published: (2024)

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
by: Ito, Takehiro, et al.
Published: (2025)

Encodings for Range Minimum Queries over Bounded Alphabets
by: Jo, Seungbum, et al.
Published: (2026)

The Power of Greedy for Online Minimum Cost Matching on the Line
by: Balkanski, Eric, et al.
Published: (2022)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
by: Blelloch, Guy E., et al.
Published: (2025)

Two-Edge Connectivity via Pac-Man Gluing
by: Garg, Mohit, et al.
Published: (2024)

Kernelization for Orthogonality Dimension
by: Haviv, Ishay, et al.
Published: (2024)

Counting Patterns in Degenerate Graphs in Constant Space
by: Komarath, Balagopal, et al.
Published: (2025)