An overview on polynomial approximation of NP-hard problems

The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between computational time and solution's qualit...

Celý popis

Podrobná bibliografia

Vydané v:	Yugoslav Journal of Operations Research Ročník 19; číslo 1; s. 3 - 40
Hlavný autor:	Paschos, Vangelis
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	University of Belgrade 2009
Predmet:	approximation algorithms computational complexity
ISSN:	0354-0243, 1820-743X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!