approximation algorithms for nphard problems bibtex
DBLP: Egon Wanke.
Improved Approximation Algorithms for Uniform Connectivity Problems.
Efficient Approximation Algorithms for the Hamming Center Problem.
Polynomial time approximation algorithms for machine scheduling.
approximation algorithms for nphard problems bibtex
Approximation algorithms for a hierarchically structured bin packing.. the NP-Hard problem of finding a heaviest planar subgraph in.
A Constant-factor Approximation Algorithm for the k-MST Problem.
Efficient Approximation Algorithms for the Hamming Center Problem.
Approximation Algorithms for PSPACE-Hard Hierarchically and.
Approximation Algorithms for Constrained Node Weighted Steiner.
In practice, evolutionary algorithms are often used to find good feasible solutions to. BibTeX. @INPROCEEDINGS{He03ananalysis, author = {Jun He and Xin Yao}. 500, Approximation Algorithms for NP--hard Problems - Hochbaum - 1997.
Wolfgang Espelage, Egon Wanke: A linear time approximation algorithm for. How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in.
Eduard Kh. Gimadi: On some Hard-to-Solve versions of the Assignment Problem. . NP-hardness and approximation algorithms for solving Euclidean problem of.