scientific article; zbMATH DE number 5199029

zbMath1118.90315MaRDI QIDQ5309465

Corina Pop Sitar, Petrică C. Pop

Publication date: 9 October 2007

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programminggeneralized minimum spanning tree problem\(\mathcal NP\)-hardcombinatorial optimization, complexity theory

Mathematics Subject Classification ID

Trees (05C05) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A two-level solution approach for solving the generalized minimum spanning tree problem

This page was built for publication: