Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph

DOI10.1002/net.21825zbMath1396.90016OpenAlexW2800659169WikidataQ129937337 ScholiaQ129937337MaRDI QIDQ4686678

Austin Buchanan, Yi-Ming Wang, Sergiy I. Butenko

Publication date: 4 October 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21825

zbMATH Keywords

Steiner treefixed-parameter tractablenode-weighted Steiner treestrong exponential time hypothesismaximum weight connected subgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Dynamic programming (90C39)

Related Items (6)

On the Exact Solution of Prize-Collecting Steiner Tree Problems ⋮ Finding dense subgraphs with maximum weighted triangle density ⋮ Optimal connected subgraphs: Integer programming formulations and polyhedra ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem ⋮ Models of random subtrees of a graph

This page was built for publication: Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph