:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gholizadeh, Hossein, Jiang, Yonggang
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	https://arxiv.org/abs/2510.03427
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
par: Brand, Jan van den, et autres
Publié: (2025)

Minimum Stable Cut and Treewidth
par: Lampis, Michael
Publié: (2021)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
par: DeHaan, Ian, et autres
Publié: (2025)

Pseudodeterministic Algorithms for Minimum Cut Problems
par: Agarwala, Aryan, et autres
Publié: (2025)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
par: Bilò, Davide, et autres
Publié: (2024)

Fast Leaf-to-Ancestor Minimum Query in the Oracle Model
par: Upirvitskiy, Aleksey, et autres
Publié: (2026)

Improved Hardness and Approximations for Cardinality-Based Minimum $s$-$t$ Cuts Problems in Hypergraphs
par: Adriaens, Florian, et autres
Publié: (2024)

The Art of Staying Ahead of Deadlines: Improved Algorithms for the Minimum Tardy Processing Time
par: Stoian, Mihail
Publié: (2024)

On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols
par: Kuschner, Jordan, et autres
Publié: (2024)

Finding Minimum Distance Preservers: A Parameterized Study
par: Simonov, Kirill, et autres
Publié: (2026)

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
par: Dragan, Feodor F., et autres
Publié: (2018)

Sumplete is Hard, Even with Two Different Numbers
par: Ruangwises, Suthee
Publié: (2023)

Better Boosting of Communication Oracles, or Not
par: Harms, Nathaniel, et autres
Publié: (2024)

Structural Parameterizations for Two Bounded Degree Problems Revisited
par: Lampis, Michael, et autres
Publié: (2023)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
par: Vroon, Mats, et autres
Publié: (2025)

Finding One Local Optimum Is Easy -- but What About Two?
par: Kobayashi, Yasuaki, et autres
Publié: (2025)

On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
par: Kurpisz, Adam, et autres
Publié: (2026)

Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
par: Kim, Eun Jung, et autres
Publié: (2022)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
par: Hanaka, Tesshu, et autres
Publié: (2023)

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
par: Jiang, Cheng, et autres
Publié: (2026)

Near-Optimality for Single-Source Personalized PageRank
par: Jiang, Xinpeng, et autres
Publié: (2025)

On Approximating the Dynamic and Discrete Network Flow Problem
par: Manna, Bubai, et autres
Publié: (2024)

NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
par: Gaspers, Serge, et autres
Publié: (2025)

A Dichotomy Theorem for Multi-Pass Streaming CSPs
par: Fei, Yumou, et autres
Publié: (2025)

A Note on Approximability of Densest At-Least-k-Subgraph
par: Laekhanukit, Bundit, et autres
Publié: (2026)

A Simple Proof that Ricochet Robots is PSPACE-Complete
par: Balanza-Martinez, Jose, et autres
Publié: (2024)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
par: Clinch, Katie, et autres
Publié: (2025)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
par: Lehner, Lisa, et autres
Publié: (2025)

A Space-space Trade-off for Directed st-Connectivity
par: Edenhofer, Roman
Publié: (2026)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
par: Buhrman, Harry, et autres
Publié: (2025)

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems
par: Kenig, Batya
Publié: (2025)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
par: Ducoffe, Guillaume
Publié: (2026)

A Unified Approach to Memory-Sample Tradeoffs for Detecting Planted Structures
par: Garg, Sumegha, et autres
Publié: (2026)

A tight quasi-polynomial bound for Global Label Min-Cut
par: Jaffke, Lars, et autres
Publié: (2022)

A New Information Complexity Measure for Multi-pass Streaming with Applications
par: Braverman, Mark, et autres
Publié: (2024)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
par: Bai, Tian, et autres
Publié: (2026)

A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing
par: Jansen, Klaus, et autres
Publié: (2025)

A lossless a priori splitting rule for split-delivery routing problems
par: Jones, Bo, et autres
Publié: (2025)

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
par: S., Karthik C., et autres
Publié: (2023)