scientific article

zbMath0983.68010MaRDI QIDQ2741494

Renato F. Werneck, Eduardo Uchoa, Marcus Poggi de Aragão

Publication date: 24 October 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

VLSI layoutSteiner problem in graphs

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (16)

Preprocessing Steiner problems from VLSI layout ⋮ A robust and scalable algorithm for the Steiner problem in graphs ⋮ The Influence of Preprocessing on Steiner Tree Approximations ⋮ A practical greedy approximation for the directed Steiner tree problem ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm ⋮ Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs ⋮ LS(graph): a constraint-based local search for constraint optimization on trees and paths ⋮ Reduction tests for the prize-collecting Steiner problem ⋮ A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems ⋮ Solving minimum-cost shared arborescence problems ⋮ Worst-case performance of Wong's Steiner tree heuristic ⋮ A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem ⋮ A distributed dual ascent algorithm for Steiner problems in multicast routing ⋮ Reformulations and solution algorithms for the maximum leaf spanning tree problem ⋮ Combinatorial optimization in system configuration design

Uses Software

• SteinLib

Cites Work

• A dual ascent approach for steiner tree problems on a directed graph
• Solving Steiner tree problems in graphs to optimality
• Preprocessing Steiner problems from VLSI layout

This page was built for publication: