Two paths location of a tree with positive or negative weights

DOI10.1016/J.TCS.2015.08.025zbMATH Open1333.90074OpenAlexW2172588432MaRDI QIDQ896109FDOQ896109

Authors: Jianjie Zhou, Erfang Shan, Liying Kang 

Publication date: 11 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.025

Recommendations

• Two paths location of a tree with positive or negative weights
• 2-medians in trees with pos/neg weights
• Finding a core of a tree with pos/neg weight
• Efficient computation of 2-medians in a tree network with positive/negative weights
• The bi‐criteria doubly weighted center‐median path problem on a tree

zbMATH Keywords

treefacility locationpathsemi-obnoxious

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80)

Cites Work

• A tighter formulation of the \(p\)-median problem
• Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Median problems with positive and negative weights on cycles and cacti
• Comparing different metaheuristic approaches for the median path problem with bounded length
• 2-medians in trees with pos/neg weights
• A linear algorithm for a core of a tree
• Optimal location of a path or tree on a network with cycles
• Extensive facility location problems on networks with equity measures
• The continuous and discrete path‐variance problems on trees
• Algorithms for central-median paths with bounded length on trees
• Finding the two-core of a tree
• Finding a core of a tree with pos/neg weight
• Mobile facility location: combinatorial filtering via weighted occupancy
• Reliability problems in multiple path-shaped facility location on networks
• The location of median paths on grid graphs
• Finding a 2-core of a tree in linear time

Cited In (4)

• Efficient computation of 2-medians in a tree network with positive/negative weights
• On the finding 2-(k,l)-core of a tree with arbitrary real weight
• On fixed-parameter solvability of the minimax path location problem
• Two paths location of a tree with positive or negative weights

This page was built for publication: Two paths location of a tree with positive or negative weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896109)