Crossmark

Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem

Crossref DOI link: https://doi.org/10.1007/s00453-018-00533-w

Published Online: 2018-12-11

Published Print: 2019-11

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

Authors

Chen, Zhi-Zhong

Lin, Guohui http://orcid.org/0000-0003-4283-3396
Wang, Lusheng

Chen, Yong

Wang, Dan
Funding

Funding for this research was provided by:

Natural Sciences and Engineering Research Council of Canada

National Natural Science Foundation of China (61672323, 11571252)

National Natural Science Foundation of China (11771114)

China Scholarship Council (201508330054)

The Hong Kong GRF (CityU 11256116)

The Grant-in-Aid for Scientific Research of the Ministry of Education, Culture, Sports, Science and Technology of Japan (24500023)
License Information

Text and Data Mining valid from 2018-12-11
More Information

Article History

Received: 19 September 2017

Accepted: 26 November 2018

First Online: 11 December 2018