Finding a core of a tree with pos/neg weight (Q1935945): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00186-012-0394-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001041237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the median-path problem / 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: Finding the \(\ell\)-core of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of 2-medians in a tree network with positive/negative weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial method for the pos/neg weighted 3-median problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus / 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: Computing the 2‐median on tree networks in O(n lg n) time / 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: A linear algorithm for a core of a tree / 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: Obnoxious Facility Location on Graphs / 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: Q5606538 / rank
 
Normal rank

Latest revision as of 05:40, 6 July 2024

scientific article
Language Label Description Also known as
English
Finding a core of a tree with pos/neg weight
scientific article

    Statements

    Finding a core of a tree with pos/neg weight (English)
    0 references
    0 references
    0 references
    20 February 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    location theory
    0 references
    core
    0 references
    semi-obnoxious
    0 references
    0 references