Content deleted Content added
m Travelling salesman problem : "TSP" link correction |
m ISBN enable wikimagic |
||
Line 19:
| title = Complexity and Approximation
| publisher = Springer
| isbn =
}}</ref>
Line 31:
| series = Texts in Theoretical Computer Science
| publisher = Springer
| isbn =
}}</ref> Note that the below referred polynomials are functions of the size of the respective functions' inputs, not the size of some implicit set of input instances.
* the size of every feasible solution is polynomially bounded,
| |||