NP-HARDNESS

作品数：9被引量：31H指数：2
导出分析报告
相关领域：自动化与计算机技术更多>>
相关期刊：《Journal of Computer Science & Technology》《Communications on Applied Mathematics and Computation》《Science China Mathematics》《Frontiers of Computer Science》更多>>
相关基金：国家自然科学基金教育部长江学者奖励计划更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-9
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
The Minimum Centroid Branch Spanning Tree Problem
《Journal of the Operations Research Society of China》2024年第2期528-539,共12页Hao Lin Cheng He 
Key Research Project of Henan Higher Education Institutions(No.20A110003).
For a spanning tree T of graph G,the centroid of T is a vertex v for which the largest component of T-v has as few vertices as possible.The number of vertices of this component is called the centroid branch weight of ...
关键词：Spanning tree optimization Centroid branch-NP-hardness Polynomial-time algorithm 
On the Complexity of Finding Tensor Ranks
《Communications on Applied Mathematics and Computation》2021年第2期281-289,共9页Mohsen Aliabadi Shmuel Friedland 
The purpose of this note is to give a linear algebra algorithm to find out if a rank of a given tensor over a field F is at most k over the algebraic closure of F,where K is a given positive integer.We estimate the ar...
关键词：Gauss elimination Homogeneous polynomial NP-HARDNESS Symmetric tensor Tensor rank 
Optimal bundles for sponsored search auctions via bracketing scheme
《Frontiers of Computer Science》2019年第2期333-342,共10页Zheng-Dong XIA Tian-Ming BU Wen-Hui GONG 
the National Natural Science Foundation of China (Grant No. 61672012).
Sponsored search auction has been recently studied and auctioneer's revenue is an important consideration in probabilistic single-item second-price auctions. Some papers have analyzed the revenue maximization problem ...
关键词：sponsored search AUCTION REVENUE MAXIMIZATION bracketing SCHEME NP-HARDNESS 
On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods
《International Journal of Communications, Network and System Sciences》2012年第11期774-784,共11页Mohamed Askali Ahmed Azouaoui Said Nouh Mostafa Belkasmi 
The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved i...
关键词：Minimum Distance Error Impulse Method Heuristic Methods Genetic Algorithms NP-HARDNESS Linear Error Correcting Codes BCH Codes QR Codes Double Circulant Codes 
Parameterized Computation and Complexity： A New Approach Dealing with NP-Hardness被引量：21
《Journal of Computer Science & Technology》2005年第1期18-37,共20页Jian-ErChen 
国家自然科学基金，教育部长江学者奖励计划
The theory of parameterized computation and complexity is a recentlydeveloped subarea in theoretical computer science. The theory is aimed at practically solving alarge number of computational problems that are theore...
关键词：ALGORITHM computational complexity NP-COMPLETENESS parameterizedcomputation approximation algorithm 
Hardness and Methods to Solve CLIQUE
《Journal of Computer Science & Technology》2001年第4期388-391,共4页朱大铭 栾峻峰 马绍汉 
the National Natural Science Foundation of China (Nos.69873027, 60073042).
The paper briefly reviews NP-hard optimization problems and their inapproximability. The hardness of solving CLIQUE problem is specifically dis- cussed. A dynamic-programming algorithm and its improved version for CLI...
关键词：algorithm NP-HARDNESS approximation ratio dynamic  programming COMPLEXITY 
Strong NP-Hardness of Single Machine Scheduling Problems with Variable Processing Time
《Journal of Modern Transportation》1998年第2期78-88,共11页周贤伟 杜文 朱健梅 
In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' of t...
关键词：single machine scheduling problem variable processing time strong NP   hardness. 
THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM被引量：10
《Systems Science and Mathematical Sciences》1992年第4期328-333,共6页YUAN Jinjiang (Department of Mathematics,Zhengzhou University,Zhengzhou 450052,China) 
This work is supported by the National Natural Science Foundation of China
In this paper we prove that the single machine common due dateweighted tardiness problem is NP-hard.
关键词：DUE DATE TARDINESS NP-COMPLETE 
A QUASI-PHYSICAL METHOD FOR SOLVING THE SCHEDULING PROBLEM OF SPACE UTILIZATION
《Science China Mathematics》1991年第9期1144-1152,共9页刘炯朗 黄文奇 陈亮 
Project supported by the National Natural Science Foundation of China.
The scheduling of space utilization can be regarded as a packing problem in 4-dimensionaltime-space while for the packing problem in 3-dimensional space there is already a meth-od for solution of a quasi-physical type...
关键词：NP-HARDNESS PACKING PROBLEM SCHEDULING problem. 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部