Algorithms and Computation

DOI10.1007/11602613MaRDI QIDQ5897902zbMATH OpenOpenAlexFDO

Authors Boaz Ben-Moshe, Binay Bhattacharya, Qiaosheng Shi

Publication date 14 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11602613

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Efficient algorithms for center problems in cactus networks
• The obnoxious center problem on weighted cactus graphs.
• scientific article; zbMATH DE number 1786156
• scientific article; zbMATH DE number 2166874
• A linear-time algorithm for solving the center problem on weighted cactus graphs

Cited in

(21)

• Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance
• The obnoxious center problem on weighted cactus graphs.
• An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs
• A linear-time algorithm for solving the center problem on weighted cactus graphs
• k-balanced center location problem: a new multi-objective facility location problem
• A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs
• Efficient algorithms for center problems in cactus networks
• A modified optimal algorithm for 2-Maxian location problems on cactus graphs
• scientific article; zbMATH DE number 4173027 (Why is no real title available?)
• Backup 2-center on interval graphs
• scientific article; zbMATH DE number 1786156 (Why is no real title available?)
• A self-stabilizing algorithm for a maximal 2-packing in a cactus graph under any scheduler
• scientific article; zbMATH DE number 2166874 (Why is no real title available?)
• The backup 2‐center and backup 2‐median problems on trees
• Bumblebee visitation problem
• On the sizes of generalized cactus graphs
• A linear-time algorithm for the center problem in weighted cycle graphs
• On 1-skeleton of the cut polytopes
• Algorithms for graphs of bounded treewidth via orthogonal range searching
• The 2-radius and 2-radiian problems on trees
• Chain hexagonal cacti: matchings and independent sets

This page was built for publication: Algorithms and Computation

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