Efficient algorithms for two generalized 2-median problems and the group median problem on trees (Q1006061): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2008.11.021 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095512997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the two-core of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-medians in trees with pos/neg weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating Two Facilities on a Tree Subject to Distance Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / 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: Group centre and group median of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316922 / 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: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Localizing 2‐medians on probabilistic and deterministic tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs / 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: Efficient algorithms for a constrained k-tree core problem in a tree network / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2008.11.021 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:26, 10 December 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for two generalized 2-median problems and the group median problem on trees
scientific article

    Statements

    Efficient algorithms for two generalized 2-median problems and the group median problem on trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 March 2009
    0 references
    trees
    0 references
    \(p\)-median
    0 references
    eccentricity
    0 references
    group median
    0 references
    network location theory
    0 references

    Identifiers