Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with approximation-algorithms
Search options not deleted
user 3139
Questions about approximation algorithms.
11
votes
1
answer
846
views
Why do NP-complete problems not have similar approximation ratios?
Since 2 NP-complete problems are by definition reducible to each other, so a solution to one of them can be obtained by using a black-box solving the other one, why don't they have similar approximati …
- 573
2
votes
1
answer
209
views
Question on the Prize-Collecting TSP's ratio related to inapprox. of general TSP
The Prize-Collecting TSP (PCTSP) is defined as the ordinary TSP with the difference that penalties are added to nodes; so we may avoid visiting a node paying its penalty, which is added to the overall …
- 573
4
votes
2
answers
995
views
Why is Metric TSP's best possible achieved approximation ratio believed to be 4/3?
Is it just that integrality gaps (LP/IP) for specific instances do not give more than 4/3? Thanks in priori.
- 573