Improved approximation for spanning star forest in dense graphs
Year of publication: |
2013
|
---|---|
Authors: | He, Jing ; Liang, Hongyu |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 25.2013, 2, p. 255-264
|
Subject: | Graphentheorie | Graph theory | Forstwirtschaft | Forestry |
-
The Forest Metrics for Graph Vertices
Chebotarev, Pavel, (2018)
-
Comparison of metaheuristics for the k-labeled spanning forest problem
Consoli, Sergio, (2017)
-
Durugbo, Christopher, (2013)
- More ...
-
The hardness and approximation of the star p-hub center problem
Liang, Hongyu, (2013)
-
The hardness and approximation of the star -hub center problem
Liang, Hongyu, (2013)
-
Voluntary disclosure, mandatory disclosure and the cost of capital
He, Jing, (2019)
- More ...