On Approximating the Maximum Simple Sharing Problem

DOI10.1007/11940128_55zbMath1135.68641OpenAlexW1498317320MaRDI QIDQ5459149

Rudolf Fleischer, Danny Z. Chen, Jian Li, Hong Zhu, Zhiyi Xie

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

This page was built for publication: On Approximating the Maximum Simple Sharing Problem