Approximation and Online Algorithms
From MaRDI portal
Publication:5713440
DOI10.1007/B106130zbMATH Open1124.68460OpenAlexW4299357393MaRDI QIDQ5713440FDOQ5713440
Publication date: 14 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106130
Recommendations
- scientific article; zbMATH DE number 2163022
- Approximation Algorithm for the Mixed Fractional Packing and Covering Problem
- Faster and simpler approximation algorithms for mixed packing and covering problems
- An Approximation Algorithm for the General Mixed Packing and Covering Problem
- scientific article; zbMATH DE number 1839427
Approximation algorithms (68W25) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Cited In (6)
- Approximation Algorithm for the Mixed Fractional Packing and Covering Problem
- Title not available (Why is that?)
- Faster and simpler approximation algorithms for mixed packing and covering problems
- An Approximation Algorithm for the General Mixed Packing and Covering Problem
- Pseudo-polynomial time algorithms for combinatorial food mixture packing problems
- Title not available (Why is that?)
This page was built for publication: Approximation and Online Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713440)
