English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

On the Approximability of the Maximum Feasible Subsystem Problem with 0/1-coefficients

MPS-Authors
/persons/resource/persons44374

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

/persons/resource/persons45251

Raman,  Rajiv
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45269

Ray,  Saurabh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45495

Sitters,  Rene
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., Raman, R., Ray, S., & Sitters, R. (2009). On the Approximability of the Maximum Feasible Subsystem Problem with 0/1-coefficients. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1210-1219). New York, NY: SIAM.


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