A dynamic programming algorithm for the maximum s-club problem on trees

doi:10.1016/j.ejor.2025.08.031

A dynamic programming algorithm for the maximum s-club problem on trees

2025-08-25

0

PRE

AI

J

José Alberto Fernández‐Zepeda *

A

Alejandro Flores-Lamas *

M

Matthew Hague *

J

Joel Antonio Trejo-Sánchez *

DOI：10.1016/j.ejor.2025.08.031

Original

Original request for help

Save

Abstract

En 中文

• A simple dynamic programming approach to compute a maximum s-club on trees. • For an arbitrary n-vertex tree, the presented algorithm runs in O(s⋅n) time. • Experimental results (on real and synthetic trees) confirm the theoretical analysis.

Keywords:

maximum s-club

dynamic programming

trees

time complexity

experimental evaluation

A dynamic programming algorithm for the maximum s-club problem on trees

Abstract

Journal

Organization