Algorithms for the constrained maximum-weight connected graph problem

DOI10.1002/(SICI)1520-6750(199610)43:7%3C985::AID-NAV4%3E3.0.CO;2-9zbMATH Open0868.90131OpenAlexW2091895894MaRDI QIDQ5689649FDOQ5689649

Authors: Heungsoon Felix Lee, Daniel R. Dooly 

Publication date: 7 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199610)43:7%3C985::aid-nav4%3E3.0.co;2-9

Recommendations

• scientific article; zbMATH DE number 1300393
• Exploring the constrained maximum edge-weight connected graph problem
• The Maximum Weight Connected Subgraph Problem
• Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph

zbMATH Keywords

heuristicSteiner tree problemmaximum-weight connected graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Cited In (10)

• On the maximum connectivity improvement problem
• Vertex covering with capacitated trees
• Some graph optimization problems with weights satisfying linear constraints
• Exploring the constrained maximum edge-weight connected graph problem
• Algorithms for (0, 1,d)-graphs withdconstrains
• Title not available (Why is that?)
• The rooted maximum node-weight connected subgraph problem
• Better algorithms for minimum weight vertex-connectivity problems
• The \textsc{WeightedCircuitsLmax} constraint
• The Maximum Weight Connected Subgraph Problem

This page was built for publication: Algorithms for the constrained maximum-weight connected graph problem

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