Imagen de Portada

An $O(n^5)$-Time Algorithm for Optimal Broadcast Domination

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Papadopoulos, Kleitos
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

An $O(n\log n)$ Algorithm for Single-Item Lot Sizing with a One-Breakpoint All-Units Discount and Non-Increasing Prices
por: Papadopoulos, Kleitos
Publicado: (2025)

An $\mathcal{O}(\log N)$ Time Algorithm for the Generalized Egg Dropping Problem
por: Papadopoulos, Kleitos
Publicado: (2026)

A Novel exact algorithm for economic lot-sizing with piecewise linear production costs
por: Papadopoulos, Kleitos
Publicado: (2024)

A faster algorithm for the construction of optimal factoring automata
por: Erlebach, Thomas, et al.
Publicado: (2024)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
por: Mu, Ta-Yu, et al.
Publicado: (2024)

Dynamic $((1+ε)\ln n)$-Approximation Algorithms for Minimum Set Cover and Dominating Set
por: Solomon, Shay, et al.
Publicado: (2023)

Algorithms and Complexity of Hedge Cluster Deletion Problems
por: Konstantinidis, Athanasios L., et al.
Publicado: (2025)

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

A Refutation of Elmasry's $\tilde{O}(m \sqrt{n})$-Time Algorithm for Single-Source Shortest Paths
por: Atalig, Sunny, et al.
Publicado: (2025)

A Linear-Time 1.5-Approximation for Broadcasting in k-Cycle Graphs
por: Bringolf, Jeffrey, et al.
Publicado: (2025)

Optimizing Distances for Multi-Broadcast in Temporal Graphs
por: Carnevale, Daniele, et al.
Publicado: (2026)

Double Exponential Lower Bound for Telephone Broadcast
por: Tale, Prafullkumar
Publicado: (2024)

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs
por: Alejandro-Soto, J. A., et al.
Publicado: (2025)

Broadcasting in Heterogeneous Tree Networks with Edge Weight Uncertainty
por: Tsou, Cheng-Hsiao, et al.
Publicado: (2024)

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

On the Complexity of Telephone Broadcasting: From Cacti to Bounded Pathwidth Graphs
por: Aminian, Aida, et al.
Publicado: (2025)

An $n^{2+o(1)}$ Time Algorithm for Single-Source Negative Weight Shortest Paths
por: Khanna, Sanjeev, et al.
Publicado: (2026)

Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm
por: Chuzhoy, Julia, et al.
Publicado: (2024)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
por: Oliveira, Mateus de Oliveira, et al.
Publicado: (2026)

Gabow's $O(\sqrt{n}m)$ Maximum Cardinality Matching Algorithm, Revisited
por: Mehlhorn, Kurt, et al.
Publicado: (2026)

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
por: Kurita, Kazuhiro, et al.
Publicado: (2022)

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

Southwest Tree: A Low-Memory Data Structure for Partial Accumulations by Non-Commutative Invertible Operations
por: Papadopoulos, Nicholas J. C.
Publicado: (2025)

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
por: Georgiadis, Loukas, et al.
Publicado: (2026)

Confluence of the Node-Domination and Edge-Domination Hypergraph Rewrite Rules
por: Amarilli, Antoine, et al.
Publicado: (2025)

Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
por: Huang, Shang-En, et al.
Publicado: (2016)

An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
por: Xu, Chao, et al.
Publicado: (2026)

Optimal Learning-Augmented Algorithm for Online Bidding
por: Lee, Changyeol, et al.
Publicado: (2026)

Simple and Optimal Sublinear Algorithms for Mean Estimation
por: Bertolotti, Beatrice, et al.
Publicado: (2024)

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
por: Opler, Michal
Publicado: (2024)

Near-Optimal Algorithm for Directed Expander Decompositions
por: Sulser, Aurelio L., et al.
Publicado: (2024)

New Algorithm for Combinatorial $n$-folds and Applications
por: Jansen, Klaus, et al.
Publicado: (2024)

Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts
por: Fischer, Nick, et al.
Publicado: (2026)

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time
por: Mahabadi, Sepideh, et al.
Publicado: (2025)

Source-Oblivious Broadcast
por: Fraigniaud, Pierre, et al.
Publicado: (2025)

Time-Optimal $k$-Server
por: Frei, Fabian, et al.
Publicado: (2025)

An Optimal Sorting Algorithm for Persistent Random Comparison Faults
por: Geissmann, Barbara, et al.
Publicado: (2025)

A Note on the Conditional Optimality of Chiba and Nishizeki's Algorithms
por: Kirkpatrick, Yael, et al.
Publicado: (2024)

Optimal Algorithms for Free Order Multiple-Choice Secretary
por: Hajiaghayi, Mohammad Taghi, et al.
Publicado: (2022)

Hardness and Algorithmic Results for Roman \{3\}-Domination
por: Reddy, Sangam Balchandar
Publicado: (2025)