Spanning trees and optimization problems
Year: 2004
Type: book-review
Source: Choice Reviews Online
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: spanning trees, minimum spanning tree, shortest path tree, approximate algorithms, polynomial-time approximation scheme, Steiner tree problem, minimum Steiner tree, maximum leaf spanning tree, tree balancing, Dijkstra's algorithm, Bellman-Ford algorithm, Kruskal's algorithm, Prim's algorithm, Boruvka's algorithm, counting spanning trees, graph optimization
Open Access status: closed
OpenAlex ID: W647522939
