A minimum length covering subgraph of a network (Q920001): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1-Center Problem: Exploiting Block Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum covering/shortest path problem: A multiobjective network design and routing formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hierarchical network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The location of central structures in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal location of a path or tree in a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3956209 / rank
 
Normal rank

Latest revision as of 11:03, 21 June 2024

scientific article
Language Label Description Also known as
English
A minimum length covering subgraph of a network
scientific article

    Statements

    A minimum length covering subgraph of a network (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    central facility
    0 references
    connected network
    0 references
    transport system
    0 references
    shortest path
    0 references
    NP- hard
    0 references