scientific article; zbMATH DE number 1163709

MaRDI QIDQ4395322zbMATH OpenFDO

Authors Cees Duin

Publication date 11 June 1998

zbMATH Keywords

reduction test for vertex eliminationSteiner problemundirected graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31) Programming involving graphs or networks (90C35)

Recommendations

• Reduction tests for the steiner problem in grapsh
• An edge elimination test for the Steiner problem in graphs
• On reductions for the Steiner problem in graphs
• scientific article; zbMATH DE number 1947441
• Publication:3471884

Cited in

(7)

• An edge elimination test for the Steiner problem in graphs
• The dynamic predicate stashing copy problem and the Steiner problem in graphs
• Reduction tests for the prize-collecting Steiner problem
• Reduction tests for the steiner problem in grapsh
• A test problem generator for the Steiner problem in graphs
• scientific article; zbMATH DE number 1947441 (Why is no real title available?)
• On reductions for the Steiner problem in graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395322)