The pos/neg-weighted median problem on block graphs with subgraph-shaped customers (Q985733): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00607-010-0084-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977215779 / 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: 2-medians in trees with pos/neg 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: The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal vertex ranking of block graphs / 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: Q3147657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Center location problems on tree graphs with subtree-shaped customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal path cover problem on block graphs / rank
 
Normal rank

Revision as of 01:18, 3 July 2024

scientific article
Language Label Description Also known as
English
The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
scientific article

    Statements

    Identifiers