New answers tagged approximation-algorithms
0
votes
The Complexity of Multi-Objective Optimization
This problem is indeed a single objective optimization problem in the case of $W=0$.(the second term become zero) If the problem is NP-hard in the single objective case, then it is also NP-hard in the ...
- 1
1
vote
Accepted
Is there FPT or XP algorithms knowm for Shortest Steiner cycle and $(a,b)$-Steiner path problem
Note that you can reduce shortest $(a,b)$-Steiner path to shortest Steiner cycle by adding a terminal vertex of degree 2 adjacent to $a$ and $b$.
If you are asking for derandomization of the Björklund,...
- 1,423
Top 50 recent answers are included