An Efficient Approximation Algorithm for Maximum Simple Sharing Problem

DOI10.3724/SP.J.1001.2008.00492MaRDI QIDQ3406336zbMATH OpenOpenAlexFDO

Authors Jian Li, Tao Zhang, Zhiyi Xie, Hong Zhu

Publication date 12 February 2010

Published in Journal of Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1001.2008.00492

zbMATH Keywords

approximation algorithmcrossing eliminationnode duplication

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• On Approximating the Maximum Simple Sharing Problem
• Approximating the Maximum Sharing Problem
• Approximation algorithms for computing maximin share allocations
• Approximation Algorithms for Computing Maximin Share Allocations
• An improved approximation algorithm for maximin shares
• Algorithm Theory - SWAT 2004
• An approximation algorithm for the general max-min resource sharing problem
• Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem
• Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
• Approximation Algorithms for the Max-Min Allocation Problem

Cited in

(3)

• Approximating the Maximum Sharing Problem
• Approximation Algorithms for Computing Maximin Share Allocations
• On Approximating the Maximum Simple Sharing Problem

This page was built for publication: An Efficient Approximation Algorithm for Maximum Simple Sharing Problem

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