Matches in SemOpenAlex for { <https://semopenalex.org/work/W3100188945> ?p ?o ?g. }
Showing items 1 to 88 of
88
with 100 items per page.
- W3100188945 abstract "The Steiner tree problem is a well-known problem in network design, routing, and VLSI design. Given a graph, edge costs, and a set of dedicated vertices (terminals), the Steiner tree problem asks to output a sub-graph that connects all terminals at minimum cost. A state-of-the-art algorithm to solve the Steiner tree problem by means of dynamic programming is the Dijkstra-Steiner algorithm. The algorithm builds a Steiner tree of the entire instance by systematically searching for smaller instances, based on subsets of the terminals, and combining Steiner trees for these smaller instances. The search heavily relies on a guiding heuristic function in order to prune the search space. However, to ensure correctness, this algorithm allows only for limited heuristic functions, namely, those that satisfy a so-called consistency condition. In this paper, we enhance the Dijkstra-Steiner algorithm and establish a revisited algorithm, called DS*. The DS* algorithm allows for arbitrary lower bounds as heuristics relaxing the previous condition on the heuristic function. Notably, we can now use linear programming based lower bounds. Further, we capture new requirements for a heuristic function in a condition, which we call admissibility. We show that admissibility is indeed weaker than consistency and establish correctness of the DS* algorithm when using an admissible heuristic function. We implement DS* and combine it with modern preprocessing, resulting in an open-source solver (DS* Solve). Finally, we compare its performance on standard benchmarks and observe a competitive behavior." @default.
- W3100188945 created "2020-11-23" @default.
- W3100188945 creator A5017525048 @default.
- W3100188945 creator A5056989280 @default.
- W3100188945 creator A5089442472 @default.
- W3100188945 date "2020-11-09" @default.
- W3100188945 modified "2023-09-26" @default.
- W3100188945 title "Solving the Steiner Tree Problem with few Terminals" @default.
- W3100188945 cites W1608030126 @default.
- W3100188945 cites W1826978891 @default.
- W3100188945 cites W1969483458 @default.
- W3100188945 cites W1989666947 @default.
- W3100188945 cites W1990061958 @default.
- W3100188945 cites W1996668544 @default.
- W3100188945 cites W2020586530 @default.
- W3100188945 cites W2049513883 @default.
- W3100188945 cites W2068362339 @default.
- W3100188945 cites W2083105191 @default.
- W3100188945 cites W2091620089 @default.
- W3100188945 cites W2117937654 @default.
- W3100188945 cites W2147534455 @default.
- W3100188945 cites W2150855695 @default.
- W3100188945 cites W2171985270 @default.
- W3100188945 cites W2401610261 @default.
- W3100188945 cites W2528914664 @default.
- W3100188945 cites W2963552748 @default.
- W3100188945 cites W3127447045 @default.
- W3100188945 hasPublicationYear "2020" @default.
- W3100188945 type Work @default.
- W3100188945 sameAs 3100188945 @default.
- W3100188945 citedByCount "0" @default.
- W3100188945 crossrefType "posted-content" @default.
- W3100188945 hasAuthorship W3100188945A5017525048 @default.
- W3100188945 hasAuthorship W3100188945A5056989280 @default.
- W3100188945 hasAuthorship W3100188945A5089442472 @default.
- W3100188945 hasConcept C11413529 @default.
- W3100188945 hasConcept C126255220 @default.
- W3100188945 hasConcept C127705205 @default.
- W3100188945 hasConcept C132525143 @default.
- W3100188945 hasConcept C173801870 @default.
- W3100188945 hasConcept C173870130 @default.
- W3100188945 hasConcept C22590252 @default.
- W3100188945 hasConcept C2778770139 @default.
- W3100188945 hasConcept C33923547 @default.
- W3100188945 hasConcept C41008148 @default.
- W3100188945 hasConcept C55439883 @default.
- W3100188945 hasConcept C76220878 @default.
- W3100188945 hasConcept C80444323 @default.
- W3100188945 hasConceptScore W3100188945C11413529 @default.
- W3100188945 hasConceptScore W3100188945C126255220 @default.
- W3100188945 hasConceptScore W3100188945C127705205 @default.
- W3100188945 hasConceptScore W3100188945C132525143 @default.
- W3100188945 hasConceptScore W3100188945C173801870 @default.
- W3100188945 hasConceptScore W3100188945C173870130 @default.
- W3100188945 hasConceptScore W3100188945C22590252 @default.
- W3100188945 hasConceptScore W3100188945C2778770139 @default.
- W3100188945 hasConceptScore W3100188945C33923547 @default.
- W3100188945 hasConceptScore W3100188945C41008148 @default.
- W3100188945 hasConceptScore W3100188945C55439883 @default.
- W3100188945 hasConceptScore W3100188945C76220878 @default.
- W3100188945 hasConceptScore W3100188945C80444323 @default.
- W3100188945 hasLocation W31001889451 @default.
- W3100188945 hasOpenAccess W3100188945 @default.
- W3100188945 hasPrimaryLocation W31001889451 @default.
- W3100188945 hasRelatedWork W1534139723 @default.
- W3100188945 hasRelatedWork W1578158709 @default.
- W3100188945 hasRelatedWork W1583496057 @default.
- W3100188945 hasRelatedWork W1608030126 @default.
- W3100188945 hasRelatedWork W163762979 @default.
- W3100188945 hasRelatedWork W1968741818 @default.
- W3100188945 hasRelatedWork W1980568536 @default.
- W3100188945 hasRelatedWork W2034664211 @default.
- W3100188945 hasRelatedWork W2044301172 @default.
- W3100188945 hasRelatedWork W2108999486 @default.
- W3100188945 hasRelatedWork W2123684730 @default.
- W3100188945 hasRelatedWork W2166942785 @default.
- W3100188945 hasRelatedWork W2544482124 @default.
- W3100188945 hasRelatedWork W28092394 @default.
- W3100188945 hasRelatedWork W3116900337 @default.
- W3100188945 hasRelatedWork W3154178108 @default.
- W3100188945 hasRelatedWork W3198319327 @default.
- W3100188945 hasRelatedWork W3210524720 @default.
- W3100188945 hasRelatedWork W55191700 @default.
- W3100188945 hasRelatedWork W95601016 @default.
- W3100188945 isParatext "false" @default.
- W3100188945 isRetracted "false" @default.
- W3100188945 magId "3100188945" @default.
- W3100188945 workType "article" @default.