Art
J-GLOBAL ID：200902141110884111   Reference number：99A0369464

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems.

NP困難問題の密な例題に対する多項式時間近似方式
Author (3)：
ARORA S

About ARORA S

(Princeton Univ., New Jersey)

About Princeton Univ., New Jersey

, 
KARGER D

About KARGER D

(MIT, Massachusetts)

About MIT, Massachusetts

, 
KARPINSKI M

About KARPINSKI M

(Univ. Bonn, Bonn, DEU)

About Univ. Bonn, Bonn, DEU


Material：
Journal of Computer and System Sciences  (J Comput Syst Sci)

About Journal of Computer and System Sciences


Volume： 58  Issue： 1  Page： 193-210  Publication year： Feb. 1999 
JST Material Number： B0861A  ISSN： 0022-0000  Document type： Article
Article type： 原著論文  Country of issue： Netherlands (NLD)  Language： ENGLISH (EN)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
*NP hard

About NP hard

,...
Semi thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
computational complexity

About computational complexity


   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=99A0369464&from=J-GLOBAL&jstjournalNo=B0861A") }}
JST classification (2)：
JST classification
Category name(code) classified by JST.
Theory of computation 
(JB02000A)

About Theory of computation

,  Mathematical programmings 
(KA03030M)

About Mathematical programmings

Terms in the title (3)：
Terms in the title
Keywords automatically extracted from the title.
NP困難問題

About NP困難問題

, 
多項式時間

About 多項式時間

, 
近似

About 近似


Return to Previous Page

TOP

BOTTOM