Original language | English |
---|---|

Title of host publication | SIAM: Proceedings of the 20th annual ACM-SiAM symposium on Discrete algorithms (SODA) |

Editors | C. Mathieu |

Place of Publication | Philadelphia |

Publisher | SIAM |

Pages | 1210-1219 |

Publication status | Published - 2009 |

Event | 20th annual ACM-SiAM symposium on Discrete algorithms (SODA) - Philadelphia Duration: 4 Jan 2009 → 6 Jan 2009 |

### Conference

Conference | 20th annual ACM-SiAM symposium on Discrete algorithms (SODA) |
---|---|

Period | 4/01/09 → 6/01/09 |

## Cite this

Elbassioni, K., Raman, R., Ray, S., & Sitters, R. A. (2009). On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. In C. Mathieu (Ed.),

*SIAM: Proceedings of the 20th annual ACM-SiAM symposium on Discrete algorithms (SODA)*(pp. 1210-1219). Philadelphia: SIAM.