Imagen de Portada

Network Unreliability in Almost-Linear Time

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cen, Ruoxu, Li, Jason, Panigrahi, Debmalya
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Hypergraph Unreliability in Quasi-Polynomial Time
por: Cen, Ruoxu, et al.
Publicado: (2024)

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

Fast Algorithms for Graph Arboricity and Related Problems
por: Cen, Ruoxu, et al.
Publicado: (2025)

Deterministic Almost-Linear-Time Gomory-Hu Trees
por: Abboud, Amir, et al.
Publicado: (2025)

Deterministic Mincut in Almost-Linear Time
por: Li, Jason
Publicado: (2021)

Bellman-Ford in Almost-Linear Time for Dense Graphs
por: Li, George Z., et al.
Publicado: (2026)

Nearly Tight Bounds for the Online Sorting Problem
por: Azar, Yossi, et al.
Publicado: (2025)

Approximating Directed Connectivity in Almost-Linear Time
por: Quanrud, Kent
Publicado: (2025)

Vizing's Theorem in Deterministic Almost-Linear Time
por: Assadi, Sepehr, et al.
Publicado: (2025)

Language Generation in the Limit: Noise, Loss, and Feedback
por: Bai, Yannan, et al.
Publicado: (2025)

Solving Hypergraph Laplacian Systems in Almost-Linear Time
por: Yoshida, Yuichi
Publicado: (2026)

Learning-Augmented Algorithms for $k$-median via Online Learning
por: Hebbar, Anish, et al.
Publicado: (2026)

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
por: Brand, Jan van den, et al.
Publicado: (2024)

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

Almost Linear Size Edit Distance Sketch
por: Koucký, Michal, et al.
Publicado: (2024)

Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method
por: Liu, Yang P.
Publicado: (2025)

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

Complexity of Local Search for CSPs Parameterized by Constraint Difference
por: Anand, Aditya, et al.
Publicado: (2025)

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
por: Henzinger, Monika, et al.
Publicado: (2024)

Separator Theorem for Minor-Free Graphs in Linear Time
por: Bonnet, Édouard, et al.
Publicado: (2025)

Local Search for Clustering in Almost-linear Time
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)

Approximating Maximum Matching Requires Almost Quadratic Time
por: Behnezhad, Soheil, et al.
Publicado: (2024)

Online Algorithms with Unreliable Guidance
por: Dallot, Julien, et al.
Publicado: (2026)

Combinatorial Optimization using Comparison Oracles
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Almost succinct representation of maximal palindromes
por: Mieno, Takuya, et al.
Publicado: (2025)

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

Almost-Optimal Sublinear Additive Spanners
por: Tan, Zihan, et al.
Publicado: (2023)

Distances in Planar Graphs are Almost for Free!
por: Mozes, Shay, et al.
Publicado: (2026)

Almost Tight Bounds for Online Hypergraph Matching
por: Tröbst, Thorben, et al.
Publicado: (2024)

Weighted $k$-Path and Other Problems in Almost $O^*(2^k)$ Deterministic Time via Dynamic Representative Sets
por: Nederlof, Jesper
Publicado: (2025)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
por: Liu, Yuxi, et al.
Publicado: (2023)

Almost Tight Bounds for Differentially Private Densest Subgraph
por: Dinitz, Michael, et al.
Publicado: (2023)

Vizing's Theorem in Near-Linear Time
por: Assadi, Sepehr, et al.
Publicado: (2024)

Parameterized Linear Time Transitive Closure
por: Kritikakis, Giorgos, et al.
Publicado: (2024)

Approximating Partition in Near-Linear Time
por: Chen, Lin, et al.
Publicado: (2024)

Verifying Shortest Paths in Linear Time
por: Shokry, Ahmed, et al.
Publicado: (2024)

On Solving Linear Systems in Sublinear Time
por: Andoni, Alexandr, et al.
Publicado: (2018)

Max-Cut with $ε$-Accurate Predictions
por: Cohen-Addad, Vincent, et al.
Publicado: (2024)

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation
por: El-Hayek, Antoine, et al.
Publicado: (2024)