Imagen de Portada

Hypergraph Unreliability in Quasi-Polynomial Time

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cen, Ruoxu, Li, Jason, Panigrahi, Debmalya
Formato:	Preprint
Publicado:	2024
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

Network Unreliability in Almost-Linear Time
por: Cen, Ruoxu, et al.
Publicado: (2025)

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)

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

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

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

Hypergraph Connectivity Augmentation in Strongly Polynomial Time
por: Bérczi, Kristóf, et al.
Publicado: (2024)

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

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

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

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

Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p
por: Bell, Tolson, et al.
Publicado: (2023)

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
por: S, Ajaykrishnan E, et al.
Publicado: (2025)

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

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

The Quasi-Polynomial Low-Degree Conjecture is False
por: Buhai, Rares-Darius, et al.
Publicado: (2025)

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

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

Counting and Sampling Labeled Chordal Graphs in Polynomial Time
por: Hebert-Johnson, Ursula, et al.
Publicado: (2023)

Sampling Unlabeled Chordal Graphs in Expected Polynomial Time
por: Hébert-Johnson, Úrsula, et al.
Publicado: (2025)

Hyper-distance Oracles in Hypergraphs
por: Preti, Giulia, et al.
Publicado: (2023)

Sketching Cuts in Graphs and Hypergraphs
por: Kogan, Dmitry, et al.
Publicado: (2014)

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

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering
por: Nezhad, Sina Bagheri, et al.
Publicado: (2025)

Engineering Hypergraph $b$-Matching Algorithms
por: Großmann, Ernestine, et al.
Publicado: (2024)

Mimicking Networks for Constrained Multicuts in Hypergraphs
por: Cho, Kyungjin, et al.
Publicado: (2024)

Compressing Hypergraphs using Suffix Sorting
por: Adler, Enno, et al.
Publicado: (2025)

Semi-Streaming Algorithms for Hypergraph Matching
por: Reinstädtler, Henrik, et al.
Publicado: (2025)

Transitivity Preserving Projection in Directed Hypergraphs
por: Parsonage, Eric, et al.
Publicado: (2025)

Efficient Parallel Algorithms for Hypergraph Matching
por: Reinstädtler, Henrik, et al.
Publicado: (2026)

Fully Dynamic Spectral Sparsification of Hypergraphs
por: Goranci, Gramoz, et al.
Publicado: (2025)

Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime
por: Jourdan, Ben, et al.
Publicado: (2024)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
por: Bampis, Evripidis, et al.
Publicado: (2025)

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

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

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
por: Crane, Alex, et al.
Publicado: (2023)

Sublinear Edge Fault Tolerant Spanners for Hypergraphs
por: He, Jialin, et al.
Publicado: (2025)

Fully Dynamic Spectral Sparsification for Directed Hypergraphs
por: Forster, Sebastian, et al.
Publicado: (2025)

Improved Certificates for Independence Number in Semirandom Hypergraphs
por: Kothari, Pravesh, et al.
Publicado: (2026)

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