scientific article; zbMATH DE number 219265
From MaRDI portal
Publication:4694752
zbMath0768.68176MaRDI QIDQ4694752
Gabriele Reich, Peter Widmayer
Publication date: 29 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Computing directed Steiner path covers, On the minimum corridor connection problem and other generalized geometric problems, Related axis: the extension to XPath towards effective XML search, An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties, Complexity of the minimum-length corridor problem, Blocking for external graph searching, How to sort by walking and swapping on paths and trees, A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods, General variable neighborhood search approach to group Steiner tree problem, \(k\)-Transmitter watchman routes, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm, The relation of connected set cover and group Steiner tree, Solving group Steiner problems as Steiner problems., Complexity of minimum corridor guarding problems, Watchman routes for lines and line segments, On graphs preserving rectilinear shortest paths in the presence of obstacles, Approximating \(k\)-generalized connectivity via collapsing HSTs, Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem, Some formulations for the group Steiner tree problem, Approximation algorithms for group prize-collecting and location-routing problems, Generalized network design problems., Approximating fault-tolerant group-Steiner problems, Unnamed Item, A greedy approximation algorithm for the group Steiner problem
