Greedy algorithms for the on-line steiner tree and generalized steiner problems (Q5060154): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On Steiner trees for bounded point sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Steiner’s Problem with Rectilinear Distance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic Steiner Tree Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reducibility among Combinatorial Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3760270 / 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: Steiner problem in networks: A survey / rank | |||
Normal rank |
Latest revision as of 08:47, 31 July 2024
scientific article; zbMATH DE number 7643422
Language | Label | Description | Also known as |
---|---|---|---|
English | Greedy algorithms for the on-line steiner tree and generalized steiner problems |
scientific article; zbMATH DE number 7643422 |
Statements
Greedy algorithms for the on-line steiner tree and generalized steiner problems (English)
0 references
18 January 2023
0 references