The backup 2‐center and backup 2‐median problems on trees (Q5191127): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4237257980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret p-center location on a network with demand uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the robust 1-center problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax Regret Median Location on a Network Under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for the minmax regret median problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the robust 1-center problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax-regret robust 1-median location on a tree / 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: Computing the 2‐median on tree networks in O(n lg n) time / 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: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / 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: Improved Algorithms for the Minmax-Regret 1-Center Problem / 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: New Results on the Complexity of <i>p</i>-Centre Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees and Optimization Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:52, 1 July 2024

scientific article; zbMATH DE number 5587964
Language Label Description Also known as
English
The backup 2‐center and backup 2‐median problems on trees
scientific article; zbMATH DE number 5587964

    Statements

    The backup 2‐center and backup 2‐median problems on trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    location problem
    0 references
    center
    0 references
    median
    0 references
    tree
    0 references
    0 references
    0 references
    0 references