:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Yoshida, Yuichi
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2602.15341
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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)

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

Parallel PLL on DAGs
por: Steil, Patrick
Publicado: (2025)

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)

Stochastic Embedding of Digraphs into DAGs
por: Filtser, Arnold
Publicado: (2025)

Covering Approximate Shortest Paths with DAGs
por: Assadi, Sepehr, et al.
Publicado: (2025)

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)

Nearly Optimal Bounds for Sample-Based Testing and Learning of $k$-Monotone Functions
por: Black, Hadley
Publicado: (2023)

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

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)

Testing Spreading Behavior in Networks with Arbitrary Topologies
por: Modanese, Augusto, et al.
Publicado: (2023)

Testing Sparse Functions over the Reals
por: Arora, Vipul, et al.
Publicado: (2026)

Directed Isoperimetry and Monotonicity Testing: A Dynamical Approach
por: Pinto Jr, Renato Ferreira
Publicado: (2024)

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

Subset verification and search algorithms for causal DAGs
por: Choo, Davin, et al.
Publicado: (2023)

A $\frac{4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs
por: Neuwohner, Meike
Publicado: (2024)

Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions
por: Lange, Jane, et al.
Publicado: (2023)

Lipschitz Continuous Allocations for Optimization Games
por: Kumabe, Soh, et al.
Publicado: (2024)

On Exact Learning of $d$-Monotone Functions
por: Bshouty, Nader H.
Publicado: (2025)

Submodular Ground-Set Pruning: Monotone Tightness and a Non-Monotone Separation
por: Kuhnle, Alan
Publicado: (2026)

Online Monotone Metric Embeddings
por: Coester, Christian, et al.
Publicado: (2026)

Monotone Submodular Multiway Partition
por: Bi, Richard, et al.
Publicado: (2024)

Safe Sequences via Dominators in DAGs for Path-Covering Problems
por: Sena, Francisco, et al.
Publicado: (2024)

A $d^{1/2+o(1)}$ Monotonicity Tester for Boolean Functions on $d$-Dimensional Hypergrids
por: Black, Hadley, et al.
Publicado: (2023)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
por: Chakraborty, Dibyayan, et al.
Publicado: (2024)

Deterministic Monotone Min-Plus Product and Convolution
por: Jin, Ce, et al.
Publicado: (2026)

Exploring Monotone Priority Queues for Dijkstra Optimization
por: Costa, Jonas, et al.
Publicado: (2024)

Simplified Tight Bounds for Monotone Minimal Perfect Hashing
por: Kosolobov, Dmitry
Publicado: (2024)

Improved Bounds for Rectangular Monotone Min-Plus Product and Applications
por: Dürr, Anita
Publicado: (2022)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
por: Kaul, Matthias, et al.
Publicado: (2025)

Scalable Fair Influence Blocking Maximization via Approximately Monotonic Submodular Optimization
por: Fang, Qiangpeng, et al.
Publicado: (2026)

A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling
por: Jansen, Klaus, et al.
Publicado: (2026)

Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
por: Bringmann, Karl, et al.
Publicado: (2024)

A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
por: Beines, Arne, et al.
Publicado: (2024)