The 2-maxian problem on cactus graphs

DOI10.1016/J.DISOPT.2014.04.001zbMATH Open1308.90090OpenAlexW2034950767MaRDI QIDQ2339821FDOQ2339821

Authors Yanyan Li

Publication date 9 April 2015

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2014.04.001

zbMATH Keywords

cactus graphslocation problem\(p\)-maxianobnoxious facility

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Recommendations

• A modified optimal algorithm for 2-Maxian location problems on cactus graphs
• The 2-median problem on cactus graphs with positive and negative weights
• Median problems on wheels and cactus graphs
• The connected \(p\)-center problem on cactus graphs
• A combinatorial algorithm for the ordered 1-median problem on cactus graphs

Cites work

• scientific article; zbMATH DE number 3328106 (Why is no real title available?)
• 2-medians in trees with pos/neg weights
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• A linear time algorithm for computing longest paths in cactus graphs
• An optimal algorithm to find maximum and minimum height spanning trees on cactus graphs
• Median problems with positive and negative weights on cycles and cacti
• Obnoxious Facility Location on Graphs
• The \(p\)-Maxian problem on interval graphs
• The \(p\)-maxian problem on a tree
• The \(p\)-maxian problem on block graphs

Cited in

(15)

• scientific article; zbMATH DE number 1187144 (Why is no real title available?)
• An optimal algorithm to find maximum and minimum height spanning trees on cactus graphs
• A combinatorial algorithm for the ordered 1-median problem on cactus graphs
• On the vertex separation of cactus graphs
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
• Centdian computation in cactus graphs
• scientific article; zbMATH DE number 5238170 (Why is no real title available?)
• The connected \(p\)-center problem on cactus graphs
• Polynomial invariants for cactuses
• Finding cactus roots in polynomial time
• The 2-median problem on cactus graphs with positive and negative weights
• A modified optimal algorithm for 2-Maxian location problems on cactus graphs
• Brill-Noether conjecture on cactus graphs
• An optimal algorithm to find maximum independent set and maximum 2-independent set on cactus graphs
• Median problems on wheels and cactus graphs

This page was built for publication: The 2-maxian problem on cactus graphs

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