NP问题练习题

最新推荐文章于 2023-03-09 21:09:08 发布
最新推荐文章于 2023-03-09 21:09:08 发布
阅读量1.7k 收藏 1
点赞数
分类专栏： 算法设计
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qq_24486635/article/details/73800067
版权
该博客讨论了在无向图中DOMINATING SET问题，即寻找不超过预算b的支配集。通过将顶点覆盖问题归约到支配集问题，证明了DOMINATING SET问题是NP问题。内容包括问题定义、转化过程和双向归约证明。
摘要由CSDN通过智能技术生成

NP问题练习题

8.20

In an undirected graph G=（V，E），we say D ⊆ V is a dominating set if every v∈V is either in D or adjacent to at least one member of D. In the DOMINATING SET problem，the input is a graph and a budget b, and the aim is to find a dominating set in the graph of size at most b，if one exists.Prove that this problem is NP-problem.

在无向图G =（V，E）中，如果每个v∈V在D中或与D的至少一个成员相邻，则D⊆V是支配集（dominating set）。在支配集问题中，输入是图和预算b，目标是在图形中找到一个主导的图，如果存在，最大为b。证明这个问题是NP问题。

答：可以将顶点覆盖问题归约到支配集问题。若要在图 G( V, E ) 中求得不大于 b 的一个顶点覆盖，可以先对图 G 做一个预处理：对每条边(u,v )∈E ，添加一个辅助顶点 w，及两条边(u,w )和 (v,w) ，如下图所示：

最低0.47元/天 解锁文章
lyc233
关注
专栏目录
算法概论：第八章NP-完全问题——课后题8.16
parishong的博客
06-20 1191
在写题目之前，想先总结一下这一章的基本内容。这一章主要讲的是NP, NPC问题。 关于NP问题 P问题，是它能够找到一个在多项式时间内解决的算法；而NP问题不是非P问题，而是可以在多项式时间里验证一个解的问题。NP问题：所有搜索问题都称为NP问题。搜索问题的特征性定义是，任意可能解的正确性都能被快速检验，也就是说，存在以问题实例I（用于确定待求解问题的数据）和可能解S为输入的高效检验算
《算法概论》第八章NP完全问题部分习题解
mattmu的博客
07-06 5452
8.10利用推广的方法证明NP-完全性。对以下每个问题，通过证明它是本章某个NP-完全问题的推广说明它是NP-完全的。
算法概论第八章 NP完全问题 习题证明
Tomjx的博客
07-05 1466
8.3 吝啬SAT问题是这样的: 给定一组字句(每个句子都是其中文字的析取)和整数k, 求一个最多有k个变量为true的满足赋值, 如果该赋值存在. 证明吝啬SAT问题是NP完全问题. 证明:       考虑将SAT归约为旅行商问题(TSP), 如果可以确定一条经过所有变量的路径, 且变量值为true的个数不超过k, 则存在这样的赋值, 反之, 则不存在; 证毕.
NP完全问题 课后习题
zsrose的博客
07-05 862
8.8 题原文： In the EXACT 4 SAT problem, the input is a set of clauses, each of which is a disjunction of exactly four literals, and such that each variable occurs at most once in each clause. The goal i
NP完全集问题
mine-Programmer
02-26 376
NP就是Non-deterministic Polynomial的问题，也即是多项式复杂程度的非确定性问题。 假设P ≠ NP的图解。若P = NP则三类相同。 而如果任何一个NP问题都能通过一个多项式时间算法转换为某个NP问题，那么这个NP问题就称为NP完全问题（Non-deterministic Polynomial complete problem）。NP完全问题也叫做NPC问题。 ...
【NP-完全问题】课后习题8.3
no553216989的博客
07-04 477
用SAT问题来规约吝啬SAT问题，若SAT问题有n个变量，那么他就等价于k=n的吝啬SAT问题。 由于SAT问题是NP-完全问题，且吝啬SAT问题能在多项式时间里规约成SAT问题，所以吝啬SAT问题是NP-完全问题
练习题练习题lianxit
06-19
通常，汉诺塔问题是一个经典的递归算法问题，涉及将多层圆盘从一根柱子移动到另一根柱子，遵循每次只能移动一个圆盘且大圆盘不能放在小圆盘之上的规则。但这个话题并未在题目描述或部分内容中体现，因此不在当前内容...
NP答题题库.rar
05-11
总的来说，"NP答题题库.rar"是一个针对2018年华为HCIP-NP认证的复习资料，它能帮助考生了解考试格式，熟悉常见问题，并提升技术理解能力。尽管它可能不包含所有最新更新，但仍然是一个有价值的参考资料，配合其他...
算法：一个NP问题的证明（课后习题）
zhangf21的博客
06-25 4329
问题描述： 课后习题8.10：利用推广的方法证明NP-完全性。对以下每个问题请通过证明它是本章某个NP-完全问题的推广说明它是NP-完全 的。 （a）子图同构：给定两个作为输入的无向图G和H，判断G是否为H的一个子图（即删除H中的某些顶点或边后，所得的新图最多只          需再修改某些顶点的名称，即可与G相同），且如果是，返回由V（G）到V（H）相关映射。 （b）最长路径：给定图
判断NP完全问题的一些蛛丝马迹
ThetaQing的博客
02-16 545
一般来说我们没有简单的办法判断问题是不是NP完全问题，但还是有一些蛛丝马迹可寻（来自《算法图解》） 元素较少时算法的运行速度非常快，但是随着元素数量的增加，速度会变得非常慢； 涉及所有组合的问题通常都是NP完全问题； 不能将问题分成小问题，必须考虑各种可能的情况。这可能是NP完全问题； 如果问题涉及序列(如旅行商问题中的城市序列)且难以解决，它可能是NP完全问题； 如果问题涉及集合（如广播台集...
np难问题近似算法(绝版好书)
12-22
这本书在国内已经绝版。目录如下 Introduction Dorit S. Hochbaum 0.1 What can approximation algorithms do for you: an illustrative example 0.2 Fundamentals and concepts 0.3 Objectives and organization of this book 0.4 Acknowledgments I Approximation Algorithms for Scheduling Leslie A. Hall 1.1 Introduction 1.2 Sequencing with Release Dates to Minimize Lateness 1.2.1 Jacksons rule 1.2.2 A simple 3/2-approximation algorithm 1.2.3 A polynomial approximation scheme 1.2.4 Precedence constraints and preprocessing 1.3 Identical parallel machines: beyond list scheduling 1.3.1 P|rj,prec|Lmax:: list scheduling revisited 1.3.2 The LPT rule for P‖Cmax 1.3.3 The LPT rule for P|rj|Cmax 1.3.4 Other results for identical parallel machines 1.4 Unrelated parallel machines 1.4.1 A 2-approximation algorithm based on linear programming 1.4.2 An approximation algorithm for minimizing cost and makespan 1.4.3 A related result from network scheduling 1.5 Shop scheduling 1.5.1 A greedy 2-approximation algorithm for open shops 1.5.2 An algorithm with an absolute error bound 1.5.3 A 2 E -approximation algorithm for fixed job and flow shops 1.5.4 The general job shop: unit-time operations 1.6 Lower bounds on approximation for makespan scheduling 1.6.1 Identical parallel machines and precedence constraints 1.6.2 Unrelated parallel machines 1.6.3 Shop scheduling 1.7 Min-sum Objectives 1.7.1 Sequencing with release dates to minimize sum of completion times 1.7.2 Sequencing with precedence constraints 1.7.3 Unrelated parallel machines 1.8 Final remarks 2 Approximation Algorithms for Bin Packing: A Survey E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson 2.1 Introduction 2.2 Worst-case analysis 2.2.1 Next fit 2.2.2 First fit 2.2.3 Best fit, worst fit, and almost any fit algorithms 2.2.4 Bounded-space online algorithms 2.2.5 Arbitrary online algorithms 2.2.6 Semi-online algorithms 2.2.7 First fit decreasing and best fit decreasing 2.2.8 Other simple offline algorithms 2.2.9 Special-case optimality, approximation schemes, and asymptotically optimal algorithms 2.2.10 Other worst-case questions 2.3 Average-case analysis 2.3.1 Bounded-space online algorithms 2.3.2 Arbitrary online algorithms 2.3.3 Offiine algorithms 2.3.4 Other average-case questions 2.4 Conclusion Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems Dorit S. Hachbaum 3.1 Introduction 3.1.1 Definitions, formulations and applications 3.1.2 Lower bounds on approximations 3.1.3 Overview of chapter 3.2 The greedy algorithm for the set cover problem 3.3 The LP-algorithm for set cover 3.4 The feasible dual approach 3.5 Using other relaxations to derive dual feasible solutions 3.6 Approximating the multicoverproblem 3.7 The optimal dual approach for the vertex cover and independent set problems: preprocessing 3.7.1 The complexity of the LP-relaxation of vertex cover and independent set 3.7.2 Easily colorable graphs 3.7.3 A greedy algorithm for independent set in unweighted graphs 3.7.4 A local-ratio theorem and subgraph removal 3.7.5 Additional algorithms without preprocessing 3.7.6 Summary of approximations for vertex cover and independent set 3.8 Integer programming with two variables per inequality 3.8.1 The half integrality and the linear programming relaxation 3.8.2 Computing all approximate solution 3.8.3 The equivalence of IP2 to 2-SAT and 2-SAT to vertex cover 3.8.4 Properties of binary integer programs 3.8.5 Dual feasible solutions for IP2 3.9 The maximum coverage problem and the greedy 3.9.1 Tile greedy approach 3.9.2 Applications of the maxinmum coverage problem 4 The Primal-Dual Methud for Approximation Algorithms and Its Applicatiun to Network Design Problems Michel X. Goemans and David P. Williamson 4.1 Introduction 4.2 The classical primal-dual method 4.3 Thc primal-dual method Im approximation algorithms 4.4 A model of network design problems 4.4.1 0-I functions 4.5 Downwards monotone functions 4.5.1 The edge-covering problem 4.5.2 Lower capacitated partitioning problems 4.5.3 Location-design and location-routing problems 4.5.4 Proof of Theorems 4.5 and 4.6 4.6 0-1 proper functions 4.6.1 The generalized Sterner tree problem 4.6.2 The T-join problem 4.6.3 The minimum-weight perfect matching problem 4.6.4 Point-to-point connection problems 4.6.5 Exact partitioning problems 4.7 General proper functions 4.8 Extensions 4.8.1 Mininmm multicut in trees 4.8.2 The prize-collecting problems 4.8.3 Vertex connectivity problems 4.9 Conclusions 5 Cut Problems and Their Application to Divide-and-Conquer David B. Shmoys 5.1 Introduction 5.2 Minimum multicuts and maximum multicommodity flow 5.2.1 Multicuts, maximum multicommodity flow, and a weak duality theorem 5.2.2 Fractional multicuts, pipe systems, and a strong duality theorem 5.2.3 Solving the linear programs 5.2.4 Finding a good multicut 5.3 Sparsest cuts and maximum concurrent flow 5.3.1 The sparsest cut problem 5.3.2 Reducing the sparsest cut problem to the minimum multicut problem 5.3.3 Embeddings and the sparsest cut problem 5.3.4 Finding a good embedding 5.3.5 The maximum concurrent flow problem 5.4 Minimum feedback arc sets and related problems 5.4.1 An LP-based approximation algorithm 5.4.2 Analyzing the algorithm Feedback 5.4.3 Finding a good partition 5.5 Finding balanced cuts and other applications 5.5.1 Finding balanced cuts 5.5.2 Applications of balanced cut theorems 5.6 Conclusions Approximation Algorithms for Finding Highly Connected Suhgraphs Samir KhulJer 6.1 Introduction 6.1.1 Outline of chapter and techniques 6.2 Edge-connectivity problems 6.2.1 Weighted edge-connectivity 6.2.2 Unweighted edge-connectivity 6.3 Vertex-connectivity problems 6.3.1 Weighted vertex-connectivity 6.3.2 Unweighted vertex-connectivity 6.4 Strong-connectivity problems 6.4.1 Polynomial time approximation algorithms 6.4.2 Nearly linear-time implementation 6.5 Connectivity augmentation 6.5.1 increasing edge connectivity from I to 2 6.5.2 Increasing vertex connectivity from I to 2 6.5.3 Increasing edge-connectivity to 3. Algorithms for Finding Low Degree Structures Balaji Raghavachari 7.1 Introduction 7.2 Toughness and degree 7.3 Matchings and MDST 7.4 MDST within one of optimal 7.4.1 Witness sets 7.4.2 The △* 1 algorithm 7.4.3 Performance analysis 7.5 Local search techniques 7.5.1 MDST problem 7.5.2 Constrained forest problems 7.5.3 Two-connected subgraphs 7.6 Problems with edge weights - points in Euclidean spaces 7.7 Open problems 8 Approximation Algorithms for Geometric Problems Marshall Bern and David Eppstein 8.1 Introduction 8.1.1 Overview of topics 8.1.2 Special nature of geometric problems 8.2 Traveling salesman problem 8.2.1 Christofides algorithm 8.2.2 Heuristics 8.2.3 TSP with neighborhoods 8.3 Steiner tree problem 8.3.1 Steiner ratios 8.3.2 Better approximations 8.4 Minimum weight triangulation 8.4.1 Triangulation without Steiner points 8.4.2 Steiner triangulation 8.5 Clustering 8.5.1 Minmax k-clustering 8.5.2 k-minimum spanning tree 8.6 Separation problems 8.6.1 Polygon separation 8.6.2 Polyhedron separation 8.6.3 Point set separation 8.7 Odds and ends 8.7.1 Covering orthogonal polygons by rectangles 8.7.2 Packing squares with fixed comers 8.7.3 Largest congruent subsets 8.7.4 Polygon bisection 8.7.5 Graph embedding 8.7.6 Low-degree spanning trees 8.7.7 Shortest paths in space 8.7.8 Longest subgraph problems 8.8 Conclusions 9 Various Notions of Approximations: Good, Better, Best, and More Dorit S. Hochbaum 9.1 Introduction 9.1.1 Overview of chapter 9.2 Good: fixed constant approximations 9.2.1 The weighted undirected vertex feedback set problem 9.2.2 The shortest superstring problem 9.2.3 How maximization versus minimization affects approximations 9.3 Better: approximation schemes 9.3.1 A fully polynomial approximation scheme for the knapsack problem 9.3.2 The minimum makespan and the technique of dual approximations 9.3.3 Geometric packing and covering--the shifting technique 9.4 Best: unless NP = P 9.4.1 The k-center problem 9.4.2 A powerful approximation technique for bottleneck problems 9.4.3 Best possible parallel approximation algorithms 9.5 Better than best 9.5.1 A FPAS for bin packing 9.5.2 A 9/8-approximation algorithm for ~dge coloring of multigraphs and beyond 9.6 Wonderful: within one unit of optimum 10 Hardness of Approximations San jeer Arora and Carsten Lund 10.1 Introduction 10.2 How to prove inapproximability results 10.2.1 The canonical problems 10.2.2 Inapproximability results for the canonical problems 10.2.3 Gap preserving reductions 10.3 Inapproximability results for problems in class I 10.3.1 Max-SNP 10.4 Inapproximability results for problems in class II 10.4.1 SETCOVER 10.5 Inapproximability results lor problems in class 111 10.5.1 LABELCOVER maximization version ,. 10.5.2 LABELCOVER mtn version 10.5.3 Nearest lattice vector problem 10.6 Inapproximability results for problems in class IV 10.6.1 CLIQUE 10.6.2 COLORING 10.7 Inapproximability results at a glance 10.7.1 How to prove other hardness results: a case study 10.8 prohabilistically checkable proofs and inapproximability 10.8.1 The PCP theorem 10.8.2 Connection to inapproximability of MAX-3SAT 10.8.3 Where the gap comes from 10.9 Open problems 10.10 Chapter notes 11 Randomized Approximation Algorithms in Combinatorial Optimization Rajeev Motwani, Joseph Seffi Naor, and Prabhakar Raghavan 11.1 Introduction 11.2 Rounding linear programs 11.2.1 The integer multicommodity flow problem 11.2.2 Covering and packing problems 11.2.3 The maximum satisfiability problem 11.2.4 Related work 11.3 Semidefinite programming 11.3.1 The maximum cut problem 11.3.2 The graph coloring problem 11.4 Concluding remarks 11.4.1 Derandomizafion and parallelization 11.4.2 Computational experience 11.4.3 Open problems 12 The Markov Chain Monte Carlo Method: An Approach to Approximate Counting and Integration Mark Jerrum and Alistair Sinclair 12.1 Introduction 12.2 An illustrative example 12.3 Two techniques for bounding the mixing time 12.3.1 Canonical paths 12.3.2 Conductance 12.4 A more complex example: monomer-dimer systems 12.5 More applications 12.5.1 The permanent 12.5.2 Volume of convex bodies 12.5.3 Statistical physics 12.5.4 Matroid bases: an open problem 12.6 The Metropolis algorithm and simulated annealing Appendix 13 Online Computation Sandy Irani and Anna R. Karlin 13.1 Introduction 13.2 Three examples of competitive analysis 13.2.1 Paging 13.2.2 The k-server problem 13.2.3 Metrical task systems 13.3 Theoretical underpinnings: deterministic algorithms 13.3.1 Lower bounds 13.3.2 Design principles 13.3.3 Bounding competitiveness 13.4 Theoretical underpinnings: randomized algorithms 13.4.1 Example: paging 13.4.2 Lower bounds 13.4.3 The relationships between the adversaries 13.5 The k-server problem revisited 13.5.1 History. 13.5.2 Notation and properties of work functions. 13.5.3 The work function algorithm WFA 13.5.4 Proof of 2k - 1 -competitiveness 13.5.5 The duality lemma 13.5.6 The potential function 13.5.7 Quasi-convexity and the duality lemma 13.6 Online load balancing and virtual circuit routing 13.6.1 Load balancing on unrelated machines 13.6.2 Online virtual circuit routing 13.6.3 Recent results 13.7 Variants of competitive analysis 13.8 Conclusions and directions for future research Glossary of Problems Index
算法第八章NP完全问题作业
SGAFPZ的博客
12-30 583
8.14 prove that the following problem is NP-complete: given an undirected graph G = (V,E) and an integer k, return a clique of size k as well as an independent set of size k, provided both exist. 题目中
算法作业 NP-complete problems 8.22
Reedw1023的博客
07-06 441
8.22  In task scheduling,it is common to use a graph representation with a node for each task and  a directed edge from task i to task j if i is a precondition for j.This directed graph depicts the p
算法分析与设计课程作业第十六周——NP-完全问题证明
hzl_ng的博客
12-31 621
算法分析与设计课程作业第十六周——NP-完全问题证明题目8.8在精确的4SAT问题中，输入为一组子句，每个子句都是恰好4个文字的析取，且每个变量最大在每个子句中出现一次，目标是求它的满足赋值——如果该赋值存在。证明精确的4SAT是NP-完全问题。证明首先，可看出精确的4SAT问题是NP问题，因为任一个赋值，要验证是否是满足赋值，代入验证只需多项式时间即可。 接着，证明可将3SAT问题归约到精确的4
算法：NP问题，NP完全问题（NPC），NPhard问题
热门推荐
明月清風
12-14 2万+
在做计算机算法关于NP完全问题这一章的作业的时候，发现有很多概念理解的不是很透彻，然后就反复看老师的讲义，在网上查阅各种资料，花了很多时间来弄懂这块的内容。发现书上的概念太正式，定义太标准，不容易很快理解，而网上的资料有些地方论述的不够全面，像我这样的新手在遇到NP家族的概念和问题的时候就很容易懵逼…因此在此将我的心得与整理的资料放在这里，一方面供我以后自己参考，避免又搞混，一方面和大家进行交流。
[Algorithms] 证明支配集问题是NP完全问题
xblog_的博客
07-14 4375
声明：原题目出自《算法概论》，解答部分为原创 Problem ：   In an undirected graph G = (V, E), we say D ⊆ V is a dominating set if every v∈V is either in D or adjacent to at least one member of D. In the DOMINATING SE
支配集(dominating set)问题是NP完全问题的一个证明
zlasd的博客
12-15 9183
支配集问题算法概论习题8.20 　　在一个无向图G=(V, E)中，我们称V的一个子集D为一个占优集，是指每个（v属于V）都属于D或与D中一个节点为邻。在占优集问题中，输入为一个图和预算b，目标是求图的一个规模不超过b的占优集——如果该集存在。证明该问题是NP-完全的。 　　注: 占优集即为支配集，是dominating set的另一种译法. 　　证明 　　我们不妨只考虑连通图，对于非连通图
P问题、NP问题、NPC问题和NP-Hard问题，相关概念与题目
小哈里的博客
11-02 2599
+ **约化**：问题A约化为问题B的含义就是，可以用问题B的解法解决A。**（变成更复杂更一般化的问题）** 例如我们有问题A：求解一元一次方程bx+c=0，问题B：求解二元一次方程ax^2+bx+c=0。 如果我们知道问题B的解法，那么一定可以知道问题A的解法，因为只要我们令a=0，问题B就和问题A等价，所以我们可以说“问题A可约化为问题B”。 很显然当我们说“问题A可约化为问题B”，那么**问题B的时间复杂度一定高于或者等于问题A的时间复杂度**。其次约化还具有一个重要性质：约化具有传递性。也就是说如
numpy基础练习
scout11123的博客
03-09 262
numpy练习
numpy线性代数练习题
最新发布
09-07
下面是一些numpy线性代数练习题的例子: 1. 计算矩阵的特征值和特征向量: ``` import numpy as np a = np.array([[1, 2], [3, 4]]) eigenvalues, eigenvectors = np.linalg.eig(a) print("特征值:", eigenvalues) ...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值