Approximation and Online Algorithms

DOI10.1007/B106130zbMATH Open1124.90342OpenAlexW4299357393MaRDI QIDQ5713428FDOQ5713428

Hadas Shachnai, Oded Shmueli, Robert Sayegh

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

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Integer programming (90C10)

Cited In (3)

• A quantitative foundation for defining and manipulating deals to facilitate automated e-commerce
• Dynamic programming based algorithms for set multicover and multiset multicover problems
• Exact algorithms for procurement problems under a total quantity discount structure

   Recommendations

• Approximation schemes for deal splitting and covering integer programs with multiplicity constraints 👍 👎
• Approximation algorithms for covering/packing integer programs 👍 👎
• Approximating covering integer programs with multiplicity constraints 👍 👎
• On Approximating (Sparse) Covering Integer Programs 👍 👎
• Approximation schemes for packing splittable items with cardinality constraints 👍 👎

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 Q5713428)