The 2-radius and 2-radiian problems on trees (Q955029): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2008.08.022 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021655423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating Facilities on a Network to Minimize Their Average Service Radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the 2‐median on tree networks in O(n lg n) time / 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: Duality in the 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: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / 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: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for solving the center problem on weighted cactus graphs / 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: Minimizing the sum of the \(k\) largest functions in linear time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for thep-centdian problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centdian subtree on tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The backup 2‐center and backup 2‐median problems on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees and Optimization Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2008.08.022 / rank
 
Normal rank

Latest revision as of 09:52, 10 December 2024

scientific article
Language Label Description Also known as
English
The 2-radius and 2-radiian problems on trees
scientific article

    Statements

    The 2-radius and 2-radiian problems on trees (English)
    0 references
    0 references
    0 references
    18 November 2008
    0 references
    facility location problem
    0 references
    center
    0 references
    median
    0 references
    centdian
    0 references
    radius
    0 references
    radiian
    0 references
    tree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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