English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply

MPS-Authors
/persons/resource/persons44374

Elbassioni,  Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44440

Fouz,  Mahmoud
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Elbassioni, K., Fouz, M., & Swamy, C. (2010). Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply. In A. Saberi (Ed.), Internet and Network Economics (pp. 462-472). Berlin: Springer. doi:10.1007/978-3-642-17572-5_39.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1605-F
Abstract
There is no abstract available