All Questions
1 question
3
votes
1
answer
408
views
reduction to np hard ordering problem
I am trying to show a reduction from a problem of ordering problem to an np-hard problem that has approximation poly-time algorithm.
My problem is: I have M auctions and in each auction I have N ...
- 31