Crossmark

A linear time algorithm for the p-maxian problem on trees with distance constraint

Crossref DOI link: https://doi.org/10.1007/s10878-020-00650-9

Published Online: 2020-09-14

Published Print: 2020-11

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Nguyen, Trung Kien https://orcid.org/0000-0002-7522-4557
Hung, Nguyen Thanh

Nguyen-Thu, Huong
Funding

Funding for this research was provided by:

National Foundation for Science and Technology Development (01.01-2019.325)
License Information

Text and Data Mining valid from 2020-09-14

Version of Record valid from 2020-09-14
More Information

Article History

First Online: 14 September 2020