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
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,...
Top 50 recent answers are included
Related Tags
approximation-algorithms × 468ds.algorithms × 155
approximation-hardness × 87
cc.complexity-theory × 77
graph-theory × 74
graph-algorithms × 71
reference-request × 64
optimization × 54
np-hardness × 44
linear-programming × 27
set-cover × 23
co.combinatorics × 22
clustering × 22
randomized-algorithms × 20
approximation × 17
packing × 14
max-cut × 14
machine-learning × 13
partition-problem × 12
counting-complexity × 11
submodularity × 11
cg.comp-geom × 10
complexity-classes × 9
graph-colouring × 9
tsp × 9