Copertina

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bhattacharya, Sayan, Kiss, Peter, Saranurak, Thatchaphol
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Deterministic Dynamic Maximal Matching in Sublinear Update Time
di: Bernstein, Aaron, et al.
Pubblicazione: (2025)

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
di: Haeupler, Bernhard, et al.
Pubblicazione: (2024)

Decremental $(1+ε)$-Approximate Maximum Eigenvector: Dynamic Power Method
di: Adil, Deeksha, et al.
Pubblicazione: (2024)

Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems
di: Bernstein, Aaron, et al.
Pubblicazione: (2025)

Chasing Positive Bodies
di: Bhattacharya, Sayan, et al.
Pubblicazione: (2023)

Fully Dynamic Exact Edge Connectivity in Sublinear Time
di: Goranci, Gramoz, et al.
Pubblicazione: (2023)

Parallel $(1+ε)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
di: Haeupler, Bernhard, et al.
Pubblicazione: (2025)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
di: Goranci, Gramoz, et al.
Pubblicazione: (2025)

Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time
di: Meierhans, Simon, et al.
Pubblicazione: (2025)

Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time
di: Hua, Kevin, et al.
Pubblicazione: (2024)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
di: Bhattacharya, Sayan, et al.
Pubblicazione: (2023)

Local Sherman's Algorithm for Multi-commodity Flow
di: Li, Jason, et al.
Pubblicazione: (2025)

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
di: Bucić, Matija, et al.
Pubblicazione: (2025)

Approximating Small Sparse Cuts
di: Anand, Aditya, et al.
Pubblicazione: (2024)

Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
di: Haeupler, Bernhard, et al.
Pubblicazione: (2025)

Approximating Directed Minimum Cut and Arborescence Packing via Directed Expander Hierarchies
di: Jiang, Yonggang, et al.
Pubblicazione: (2025)

A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures
di: Haeupler, Bernhard, et al.
Pubblicazione: (2026)

Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time
di: Bernstein, Aaron, et al.
Pubblicazione: (2024)

Expander Decomposition with Almost Optimal Overhead
di: Bansal, Nikhil, et al.
Pubblicazione: (2026)

DAG Projections: Reducing Distance and Flow Problems to DAGs
di: Haeupler, Bernhard, et al.
Pubblicazione: (2026)

Reducing Shortcut and Hopset Constructions to Shallow Graphs
di: Haeupler, Bernhard, et al.
Pubblicazione: (2025)

Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies
di: Long, Yaowei, et al.
Pubblicazione: (2024)

Near-Optimal Fault-Tolerant Strong Connectivity Preservers
di: Hoppenworth, Gary, et al.
Pubblicazione: (2025)

Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
di: Anand, Aditya, et al.
Pubblicazione: (2024)

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries
di: Shah, Vihan
Pubblicazione: (2026)

Fully Dynamic Set Cover: Worst-Case Recourse and Update Time
di: Bhattacharya, Sayan, et al.
Pubblicazione: (2025)

Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
di: Bhattacharya, Sayan, et al.
Pubblicazione: (2024)

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

Unbreakable Decomposition in Close-to-Linear Time
di: Anand, Aditya, et al.
Pubblicazione: (2024)

Space Complexity of Vertex Connectivity Oracles
di: Pettie, Seth, et al.
Pubblicazione: (2022)

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
di: Anand, Aditya, et al.
Pubblicazione: (2025)

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
di: Haeupler, Bernhard, et al.
Pubblicazione: (2025)

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
di: Jiang, Yonggang, et al.
Pubblicazione: (2025)

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time
di: Mahabadi, Sepideh, et al.
Pubblicazione: (2025)

Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse
di: Bhattacharya, Sayan, et al.
Pubblicazione: (2024)

Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
di: Chen, Daoyuan, et al.
Pubblicazione: (2024)

Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
di: Ashvinkumar, Vikrant, et al.
Pubblicazione: (2026)

Dynamic Correlation Clustering in Sublinear Update Time
di: Cohen-Addad, Vincent, et al.
Pubblicazione: (2024)

Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
di: Li, Xizhe, et al.
Pubblicazione: (2026)

Additive One Approximation for Minimum Degree Spanning Tree: Breaking the $O(mn)$ Time Barrier
di: Bhattacharya, Sayan, et al.
Pubblicazione: (2026)