Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top Users
Digests
Yury Kartynnik
top
accounts
reputation
activity
bookmarks
subscriptions
Top Questions
6
votes
Why the reduction from MINIMUM SET COVER to MINIMUM DOMINATING SET means $c \log n$-inapproximability for MINIMUM DOMINATING SET
cc.complexity-theory
approximation-hardness
reductions
set-cover
asked May 25, 2012 at 15:09
cstheory.stackexchange.com
5
votes
MIS complexity in cubic triangle-free graphs
complexity-theory
reference-request
np-complete
reductions
asked Feb 10, 2016 at 13:26
cs.stackexchange.com
Top Answers
No answers with score of 5 or more
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com
cs.stackexchange.com