Approximation Algorithm for the Mixed Fractional Packing and Covering Problem

DOI10.1137/030601570MaRDI QIDQ3440212zbMATH OpenOpenAlexFDO

Authors Klaus Jansen

Publication date 22 May 2007

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/030601570

zbMATH Keywords

approximation algorithmslinear and convex optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 2163022
• An Approximation Algorithm for the General Mixed Packing and Covering Problem
• Faster and simpler approximation algorithms for mixed packing and covering problems
• Approximation and Online Algorithms
• Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations

Cited in

(7)

• Packing trees in communication networks
• An Approximation Algorithm for the General Mixed Packing and Covering Problem
• scientific article; zbMATH DE number 2163022 (Why is no real title available?)
• Approximation and Online Algorithms
• Faster and simpler approximation algorithms for mixed packing and covering problems
• Pseudo-polynomial time algorithms for combinatorial food mixture packing problems
• Approximation algorithms for general packing problems and their application to the multicast congestion problem

This page was built for publication: Approximation Algorithm for the Mixed Fractional Packing and Covering Problem

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