Two Paths Location of a Tree with Positive or Negative Weights
From MaRDI portal
Publication:2942409
DOI10.1007/978-3-319-12691-3_25zbMath1333.90073OpenAlexW2114477631MaRDI QIDQ2942409
Jianjie Zhou, Erfang Shan, Li-ying Kang
Publication date: 11 September 2015
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_25
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80)
Cites Work
- Median problems with positive and negative weights on cycles and cacti
- Algorithms for central-median paths with bounded length on trees
- Comparing different metaheuristic approaches for the median path problem with bounded length
- Extensive facility location problems on networks with equity measures
- Finding the two-core of a tree
- 2-medians in trees with pos/neg weights
- Finding a core of a tree with pos/neg weight
- Mobile facility location: combinatorial filtering via weighted occupancy
- A tighter formulation of the \(p\)-median problem
- Reliability problems in multiple path-shaped facility location on networks
- The location of median paths on grid graphs
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Finding a 2-Core of a Tree in Linear Time
- Optimal location of a path or tree on a network with cycles
- 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 a core of a tree
- The continuous and discrete path‐variance problems on trees
This page was built for publication: Two Paths Location of a Tree with Positive or Negative Weights
