Name
Abstract | ||
|---|---|---|
We review the literature on minimum spanning tree problems with two or more objective functions (MOST) each of which is of the sum or bottleneck type. Theoretical aspects of different types of this problem are summarized and available algorithms are categorized and explained. The paper includes a concise tabular presentation of all the reviewed papers. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02094-0_6 | Algorithmics of Large and Complex Networks |
Keywords | Field | DocType |
multiple objective minimum spanning,tree problem,available algorithm,theoretical aspect,objective function,tree problems,different type,bottleneck type,concise tabular presentation,minimum spanning tree | Bottleneck,Mathematical optimization,Mathematics,Minimum spanning tree | Conference |
Volume | ISSN | Citations |
5515 | 0302-9743 | 12 |
PageRank | References | Authors |
0.57 | 18 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stefan Ruzika | 1 | 174 | 21.91 |
| Horst W. Hamacher | 2 | 562 | 57.39 |