The centdian subtree on tree networks (Q1602695): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1850962
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Dionisio Perez-Britos / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for path medi-centers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Medi-centre Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of paths on trees with minimal eccentricity and superior section / 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: Generalized Selection and Ranking: Sorted Matrices / 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: Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Medi-Centers of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Complexity of <i>p</i>-Centre 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: The optimal location of a path or tree in a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the core of a tree with a specified length / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum-max bicriterion path problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Finding a Core of a Tree with a Specified Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a Core and k-Tree Core of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4367277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized <i>P</i>‐forest problem on a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540080 / rank
 
Normal rank

Latest revision as of 11:07, 4 June 2024

scientific article
Language Label Description Also known as
English
The centdian subtree on tree networks
scientific article

    Statements

    The centdian subtree on tree networks (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2002
    0 references
    0 references
    optimal location of a tree shaped facility
    0 references
    0 references