On-line Steiner trees in the Euclidean plane (Q685176): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A travelling salesman problem in the \(k\)-dimensional unit cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Reliable Communication Networks of Small Weight Online / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric problem involving the nearest neighbour algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem seminar / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank

Latest revision as of 10:29, 22 May 2024

scientific article
Language Label Description Also known as
English
On-line Steiner trees in the Euclidean plane
scientific article

    Statements