On Approximating the Maximum Simple Sharing Problem

DOI10.1007/11940128_55MaRDI QIDQ5459149zbMATH OpenOpenAlexFDO

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

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

Recommendations

• Approximating the Maximum Sharing Problem
• An Efficient Approximation Algorithm for Maximum Simple Sharing Problem
• The P k Partition Problem and Related Problems in Bipartite Graphs
• Maximum series-parallel subgraph
• A ``maximum node clustering problem

Cited in

(5)

• Sharing-group allocation problems
• An Efficient Approximation Algorithm for Maximum Simple Sharing Problem
• Approximating the Maximum Sharing Problem
• A two‐commodity sharing problem on networks
• Approximation Algorithms for Computing Maximin Share Allocations

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

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