Dealing with hard problems : (lecture notes on approximation algorithms and randomized algorithms)
Year of publication: |
1990
|
---|---|
Authors: | Chvátal, Vašek |
Publisher: |
Bonn : Forschungsinst. für Diskrete Mathematik [u.a.] |
Subject: | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
Computing integral solutions of complementarity problems
Laan, Gerard van der, (2004)
- More ...
-
Chvátal, Vašek,
-
Recognizing dart-free perfect graphs
Chvátal, Vašek, (1989)
-
Almost all graphs with 1.44n edges are 3-colourable
Chvátal, Vašek, (1989)
- More ...