A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_30 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2256142104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solving the rooted distance-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Steiner Tree Problem with Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-minimal trees in directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A series of approximation algorithms for the acyclic directed Steiner tree problem / rank
 
Normal rank

Latest revision as of 04:44, 4 July 2024

scientific article
Language Label Description Also known as
English
A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
scientific article

    Statements

    A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (English)
    0 references
    0 references
    0 references
    24 June 2011
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references