{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T01:26:53Z","timestamp":1648517213894},"reference-count":19,"publisher":"World Scientific Pub Co Pte Lt","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2012,11]]},"abstract":"<jats:p> The spanning star forest problem is an interesting algorithmic problem in combinatorial optimization and finds different applications. We generalize it into the spanning k-tree forest problem, which is to find a maximum spanning forest in which each tree component has a central vertex and other vertices in the component have distance at most k away from the central vertex. We show that this new problem can be approximated with ratio [Formula: see text] in polynomial time for both undirected and directed graphs. In the weighted distance model, a \u00bd-approximation algorithm is presented for it. <\/jats:p>","DOI":"10.1142\/s0129054112500232","type":"journal-article","created":{"date-parts":[[2013,1,30]],"date-time":"2013-01-30T09:18:50Z","timestamp":1359537530000},"page":"1543-1554","source":"Crossref","is-referenced-by-count":0,"title":["APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM"],"prefix":"10.1142","volume":"23","author":[{"given":"CHUNG-SHOU","family":"LIAO","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 30013, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LOUXIN","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National University of Singapore, 10 Lower Kent Ridge Road, Singapore 119076, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,1,30]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-009-9614-9"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03816-7_9"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_14"},{"key":"p_5","first-page":"29","author":"Bock F.","year":"1971","journal-title":"New York"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251219"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090403"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1137\/080735503"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_4"},{"key":"p_10","first-page":"1396","volume":"14","author":"Chu Y.J.","year":"1965","journal-title":"Science Sinica"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17461-2_13"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21204-8_11"},{"key":"p_15","first-page":"11","volume":"16","author":"Henning M.A.","year":"1991","journal-title":"J. Combin. Inform. System. Sci."},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00074-7"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214106"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010305"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1137\/070682150"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321964"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070103"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054112500232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:11:15Z","timestamp":1565093475000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054112500232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":19,"journal-issue":{"issue":"07","published-online":{"date-parts":[[2013,1,30]]},"published-print":{"date-parts":[[2012,11]]}},"alternative-id":["10.1142\/S0129054112500232"],"URL":"https:\/\/doi.org\/10.1142\/s0129054112500232","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11]]}}}