Fast local search for the Steiner problem in graphs

DOI10.1145/2133803.2184448MaRDI QIDQ5406267zbMATH OpenOpenAlexFDO

Authors 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

algorithmsdata structuresexperimental evaluationheuristicslocal searchSteiner trees

Mathematics Subject Classification ID

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

Recommendations

• Fast local search for Steiner trees in graphs
• scientific article; zbMATH DE number 1323037
• Publication:4945802
• Parallel local search for Steiner trees in graphs
• scientific article; zbMATH DE number 222076

Cited in

(13)

• A robust and scalable algorithm for the Steiner problem in graphs
• Swap-vertex based neighborhood for Steiner tree problems
• Parallel local search for Steiner trees in graphs
• Local optimization in the Steiner problem on the Euclidean plane
• scientific article; zbMATH DE number 1323037 (Why is no real title available?)
• Local search: is brute-force avoidable?
• scientific article; zbMATH DE number 1424553 (Why is no real title available?)
• A local-search algorithm for Steiner forest
• Fast local search for Steiner trees in graphs
• Solving Steiner trees: Recent advances, challenges, and perspectives
• NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
• Multi-qubit lattice surgery scheduling
• A partition-and-merge algorithm for solving the Steiner tree problem in large graphs

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

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