Approximation algorithms for NP-hard problems

出版社:?吢 : 厧徴迵遡喥?啟嘾, 1998.
ISBN:7506236303
出版年:1998
作者:Hochbaum,Dorit S.
资源类型:图书
细分类型:西文文献
相关推荐

Approximation algorithms for NP-hard problems

  • 作者:Hochbaum,Dorit S.
  • ISBN:0534949681
  • 出版社:Boston : PWS Pub. Co., c1997.
  • 出版年:1997

算法详解. 卷4, NP-Hard问题算法. Part 4, Algorithms for NP-Hard problems

  • 作者:拉夫加登
  • ISBN:9787115609120
  • 出版社:人民邮电出版社
  • 出版年:2023

Computer sciences department report 356 : fast algorithms for np-hard problems which are optimal or

  • 作者:Computer Sciences Department University of Wisconsin-Madison.
  • ISBN:0000000000
  • 出版社:[S. l. : s. n.], 1979.
  • 出版年:1979

Computer sciences department report 351 : polynomial time algorithms for np-hard prloblems which are

  • 作者:Computer Sciences Department University of Wisconsin-Madison.
  • ISBN:0000000000
  • 出版社:[S. l. : s. n.], 1979.
  • 出版年:1979

Approximation algorithms

  • 作者:Vazirani,Vijay V.
  • ISBN:3540653678
  • 出版社:Berlin ; New York : Springer, c2001.
  • 出版年:2001

Graph algorithms and NP-Completeness.

  • 作者:Mehlhorn,Kurt,
  • ISBN:038713641X
  • 出版社:Berlin : Springer-Verlag, 1984.
  • 出版年:1984