Skip to main content

All Questions

1 question with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
0 votes
0 answers
50 views

Can we talk about approximation when the decision problem for solution existence is NP-Hard

I am wishing to design an approximation algorithm for an optimization problem where the existence of solution for corresponding decision problem is not guaranteed. Is it wise to find an approximation ...
Hemraj Raikwar's user avatar