Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10331883 | Information Processing Letters | 2015 | 4 Pages |
Abstract
In this paper we present a non-trivial LP-rounding algorithm for RMAS with approximation ratio 22â2.828. Our result shows that, in order to prove a 4-hardness of approximation result for VP (if possible), one should consider reductions from harder problems. Alternatively, our approach might suggest a different way to design approximation algorithms for VP.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Fabrizio Grandoni, Tomasz Kociumaka, MichaÅ WÅodarczyk,