The 2-maxian problem on cactus graphs

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

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)

Cites Work

• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• Title not available (Why is that?)
• Median problems with positive and negative weights on cycles and cacti
• The \(p\)-maxian problem on a tree
• Obnoxious Facility Location on Graphs
• 2-medians in trees with pos/neg weights
• The \(p\)-Maxian problem on interval graphs
• The \(p\)-maxian problem on block graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• A combinatorial algorithm for the ordered 1-median problem on cactus graphs
• Polynomial invariants for cactuses
• Title not available (Why is that?)
• A modified optimal algorithm for 2-maxian location problems on cactus graphs
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
• Title not available (Why is that?)
• Brill-Noether conjecture on 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)