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