Imagen de Portada

Solving Hypergraph Laplacian Systems in Almost-Linear Time

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Yoshida, Yuichi
Formato:	Preprint
Publicado:	2026
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

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

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

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

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

Tolerant Testing for Unique Games
por: Yoshida, Yuichi
Publicado: (2026)

Lower Bounds for Testing Directed Acyclicity in the Unidirectional Bounded-Degree Model
por: Yoshida, Yuichi
Publicado: (2026)

Testing Monotonicity of Real-Valued Functions on DAGs
por: Yoshida, Yuichi
Publicado: (2026)

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

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)

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

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

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
por: Khanna, Sanjeev, et al.
Publicado: (2024)

On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time
por: Kwok, Tsz Chiu, et al.
Publicado: (2025)

Entrywise Approximate Laplacian Solving
por: Chen, Jingbang, et al.
Publicado: (2024)

Average sensitivity of the Knapsack Problem
por: Kumabe, Soh, et al.
Publicado: (2024)

Lipschitz Continuous Algorithms for Covering Problems
por: Kumabe, Soh, et al.
Publicado: (2023)

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

Non-Signaling Locality Lower Bounds for Dominating Set
por: Fleming, Noah, et al.
Publicado: (2026)

$O(\log n)$-Approximation Algorithms for Bipartiteness Ratio
por: Soma, Tasuku, et al.
Publicado: (2025)

Courcelle's Theorem for Lipschitz Continuity
por: Gima, Tatsuya, et al.
Publicado: (2025)

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

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

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

Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
por: Khanna, Sanjeev, et al.
Publicado: (2024)

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

From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model
por: Sakaue, Shinsaku, et al.
Publicado: (2026)

Low-Sensitivity Matching via Sampling from Gibbs Distributions
por: Yoshida, Yuichi, et al.
Publicado: (2025)

Sensitivity Lower Bounds for Approximaiton Algorithms
por: Fleming, Noah, et al.
Publicado: (2024)

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

Solving Linear Programs with Differential Privacy
por: Ene, Alina, et al.
Publicado: (2025)

Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Pointwise Lipschitz Continuous Graph Algorithms
por: Liu, Quanquan C., et al.
Publicado: (2024)

Solving Positive Linear Programs with Differential Privacy
por: Ene, Alina, et al.
Publicado: (2026)

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)

Solving the Correlation Cluster LP in Sublinear Time
por: Cao, Nairen, et al.
Publicado: (2025)

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

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

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