Matches in SemOpenAlex for { <https://semopenalex.org/work/W4251859813> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W4251859813 abstract "Previous chapter Next chapter Full AccessProceedings Proceedings of the 2009 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)On the approximability of the maximum feasible subsystem problem with 0/1-coefficientsKhaled Elbassioni, Rajiv Raman, Saurabh Ray, and René SittersKhaled Elbassioni, Rajiv Raman, Saurabh Ray, and René Sitterspp.1210 - 1219Chapter DOI:https://doi.org/10.1137/1.9781611973068.131PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract Given a system of constraints , where ai ∊ {0, 1}n, and ℓi, ui ∊ ℝ+, for i = 1, …, m, we consider the problem Mrfs of finding the largest subsystem for which there exists a feasible solution x ≥ 0. We present approximation algorithms and inapproximability results for this problem, and study some important special cases. Our main contributions are: 1. In the general case, where ai ∊ {0, 1}n, a sharp separation in the approximability between the case when L = max{ℓ1, ⃛, ℓm} is bounded above by a polynomial in n and m, and the case when it is not. 2. In the case where A is an interval matrix, a sharp separation in approximability between the case where we allow a violation of the upper bounds by at most a (1 + ∊) factor, for any fixed ∊ > 0 and the case where no violations are allowed. Along the way, we prove that the induced matching problem on bipartite graphs is inapproximable beyond a factor of , for any ∊ > 0 unless NP=ZPP. Finally, we also show applications of Mrfs to some recently studied pricing problems. Previous chapter Next chapter RelatedDetails Published:2009ISBN:978-0-89871-680-1eISBN:978-1-61197-306-8 https://doi.org/10.1137/1.9781611973068Book Series Name:ProceedingsBook Code:PR132Book Pages:xviii + 1288" @default.
- W4251859813 created "2022-05-12" @default.
- W4251859813 creator A5000070192 @default.
- W4251859813 creator A5044595322 @default.
- W4251859813 creator A5047920456 @default.
- W4251859813 creator A5077617319 @default.
- W4251859813 date "2009-01-04" @default.
- W4251859813 modified "2023-10-03" @default.
- W4251859813 title "On the approximability of the maximum feasible subsystem problem with 0/1-coefficients" @default.
- W4251859813 doi "https://doi.org/10.1137/1.9781611973068.131" @default.
- W4251859813 hasPublicationYear "2009" @default.
- W4251859813 type Work @default.
- W4251859813 citedByCount "6" @default.
- W4251859813 countsByYear W42518598132012 @default.
- W4251859813 countsByYear W42518598132013 @default.
- W4251859813 countsByYear W42518598132017 @default.
- W4251859813 crossrefType "proceedings-article" @default.
- W4251859813 hasAuthorship W4251859813A5000070192 @default.
- W4251859813 hasAuthorship W4251859813A5044595322 @default.
- W4251859813 hasAuthorship W4251859813A5047920456 @default.
- W4251859813 hasAuthorship W4251859813A5077617319 @default.
- W4251859813 hasBestOaLocation W42518598132 @default.
- W4251859813 hasConcept C105795698 @default.
- W4251859813 hasConcept C114614502 @default.
- W4251859813 hasConcept C118615104 @default.
- W4251859813 hasConcept C132525143 @default.
- W4251859813 hasConcept C134306372 @default.
- W4251859813 hasConcept C148764684 @default.
- W4251859813 hasConcept C165064840 @default.
- W4251859813 hasConcept C197657726 @default.
- W4251859813 hasConcept C2778067643 @default.
- W4251859813 hasConcept C33923547 @default.
- W4251859813 hasConcept C34388435 @default.
- W4251859813 hasConcept C40687702 @default.
- W4251859813 hasConcept C41008148 @default.
- W4251859813 hasConcept C77553402 @default.
- W4251859813 hasConceptScore W4251859813C105795698 @default.
- W4251859813 hasConceptScore W4251859813C114614502 @default.
- W4251859813 hasConceptScore W4251859813C118615104 @default.
- W4251859813 hasConceptScore W4251859813C132525143 @default.
- W4251859813 hasConceptScore W4251859813C134306372 @default.
- W4251859813 hasConceptScore W4251859813C148764684 @default.
- W4251859813 hasConceptScore W4251859813C165064840 @default.
- W4251859813 hasConceptScore W4251859813C197657726 @default.
- W4251859813 hasConceptScore W4251859813C2778067643 @default.
- W4251859813 hasConceptScore W4251859813C33923547 @default.
- W4251859813 hasConceptScore W4251859813C34388435 @default.
- W4251859813 hasConceptScore W4251859813C40687702 @default.
- W4251859813 hasConceptScore W4251859813C41008148 @default.
- W4251859813 hasConceptScore W4251859813C77553402 @default.
- W4251859813 hasLocation W42518598131 @default.
- W4251859813 hasLocation W42518598132 @default.
- W4251859813 hasOpenAccess W4251859813 @default.
- W4251859813 hasPrimaryLocation W42518598131 @default.
- W4251859813 hasRelatedWork W1655051759 @default.
- W4251859813 hasRelatedWork W2004533347 @default.
- W4251859813 hasRelatedWork W2043525791 @default.
- W4251859813 hasRelatedWork W2108149667 @default.
- W4251859813 hasRelatedWork W2156058221 @default.
- W4251859813 hasRelatedWork W2283513731 @default.
- W4251859813 hasRelatedWork W2579720493 @default.
- W4251859813 hasRelatedWork W2798321768 @default.
- W4251859813 hasRelatedWork W2799145821 @default.
- W4251859813 hasRelatedWork W2952935049 @default.
- W4251859813 isParatext "false" @default.
- W4251859813 isRetracted "false" @default.
- W4251859813 workType "article" @default.