A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
From MaRDI portal
Publication:1387702
DOI10.1007/BF02684332zbMATH Open0904.90098MaRDI QIDQ1387702FDOQ1387702
Authors: Rainer E. Burkard, Jakob Krarup 
Publication date: 8 June 1998
Published in: Computing (Search for Journal in Brave)
Recommendations
- A simple linear time algorithm for computing a 1-median on cactus graphs
- The 2-median problem on cactus graphs with positive and negative weights
- An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs
- Median problems on wheels and cactus graphs
- Center problems with pos/neg weights on trees
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Dynamic and static algorithms for optimal placement of resources in a tree
- Linear-time computation of optimal subgraphs of decomposable graphs
- Block-vertex duality and the one-median problem
Cited In (50)
- The \(p\)-maxian problem on a tree
- Classical and inverse median location problems under uncertain environment
- A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs
- The backup 2-median problem on block graphs
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
- Discrete optimization: an Austrian view
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- A combinatorial algorithm for the ordered 1-median problem on cactus graphs
- The \(p\)-maxian problem on block graphs
- Efficient computation of 2-medians in a tree network with positive/negative weights
- Robust location problems with pos/neg weights on a tree
- The web proxy location problem in general tree of rings networks
- An ant colony algorithm for the pos/neg weighted \(p\)-median problem
- A hybrid algorithm for the uncertain inverse \(p\)-median location problem
- 2-medians in trees with pos/neg weights
- The connected \(p\)-center problem on cactus graphs
- Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights
- The Hosoya polynomial of double weighted graphs
- A modified optimal algorithm for 2-Maxian location problems on cactus graphs
- Exploiting Structure: Location Problems on Trees and Treelike Graphs
- The 2-maxian problem on cactus graphs
- The connected \(p\)-median problem on block graphs
- Computing the center of uncertain points on cactus graphs
- Exploration of dynamic cactuses with sub-logarithmic overhead
- Center problems with pos/neg weights on trees
- Median problems with positive and negative weights on cycles and cacti
- Discrete location problems with push-pull objectives
- Two paths location of a tree with positive or negative weights
- The obnoxious center problem on weighted cactus graphs.
- A polynomial method for the pos/neg weighted 3-median problem on a tree
- The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
- Bumblebee visitation problem
- Efficient algorithms for center problems in cactus networks
- The 2-median problem on cactus graphs with positive and negative weights
- A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights
- An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs
- The multi-facility median problem with Pos/Neg weights on general graphs
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs
- Data aggregation for \(p\)-median problems
- Testing outerplanarity of bounded degree graphs
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
- Algorithmic results for ordered median problems
- Finding a core of a tree with pos/neg weight
- A genetic algorithm for the \(p\)-median problem with pos/neg weights
- The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
- The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers
- Median problems on wheels and cactus graphs
- A simple linear time algorithm for computing a 1-median on cactus graphs
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
- A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment
This page was built for publication: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1387702)
