Fast local search for the steiner problem in graphs

DOI10.1145/2133803.2184448zbMath1284.05313OpenAlexW2091620089MaRDI QIDQ5406267

Eduardo Uchoa, Renato F. Werneck

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2133803.2184448

zbMATH Keywords

algorithmsheuristicslocal searchdata structuresSteiner treesexperimental evaluation

Mathematics Subject Classification ID

Trees (05C05) Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

A robust and scalable algorithm for the Steiner problem in graphs ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Swap-vertex based neighborhood for Steiner tree problems

This page was built for publication: Fast local search for the steiner problem in graphs