Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Conditional Location Problems on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding kth paths and p-centers by generating and searching good data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating path- or tree-shaped facilities on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding P-centers on a weighted tree (for relatively small P) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of extensive facility location in networks / 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: Q4367277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centdian subtree on tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional location of path and tree shaped facilities on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems / rank
 
Normal rank

Revision as of 01:44, 2 July 2024

scientific article
Language Label Description Also known as
English
Optimal algorithms for the path/tree-shaped facility location problems in trees
scientific article

    Statements

    Optimal algorithms for the path/tree-shaped facility location problems in trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 October 2009
    0 references
    subgraphs
    0 references
    parametric-pruning method
    0 references

    Identifiers

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