Approximating the Maximum Sharing Problem

DOI10.1007/978-3-540-73951-7_6MaRDI QIDQ3603514zbMATH OpenOpenAlexFDO

Authors Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Jian Li, Michael Niemier, Zhiyi Xie, Hong Zhu, Xiaobo Hu

Publication date 17 February 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-73951-7_6

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) Approximation algorithms (68W25)

Recommendations

• On Approximating the Maximum Simple Sharing Problem
• An Efficient Approximation Algorithm for Maximum Simple Sharing Problem
• scientific article; zbMATH DE number 2080247
• The minimum maximal k-partial-matching problem
• Algorithms and Computation

Cited in

(4)

• On Approximating the Maximum Simple Sharing Problem
• Sharing-group allocation problems
• Approximation Algorithms for Computing Maximin Share Allocations
• An Efficient Approximation Algorithm for Maximum Simple Sharing Problem

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

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