標(biāo)題: Titlebook: Complexity and Approximation; Combinatorial Optimi Giorgio Ausiello,Alberto Marchetti-Spaccamela,Vigg Textbook 1999 Springer-Verlag Berlin [打印本頁] 作者: ED431 時間: 2025-3-21 17:03
書目名稱Complexity and Approximation影響因子(影響力)
書目名稱Complexity and Approximation影響因子(影響力)學(xué)科排名
書目名稱Complexity and Approximation網(wǎng)絡(luò)公開度
書目名稱Complexity and Approximation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Complexity and Approximation被引頻次
書目名稱Complexity and Approximation被引頻次學(xué)科排名
書目名稱Complexity and Approximation年度引用
書目名稱Complexity and Approximation年度引用學(xué)科排名
書目名稱Complexity and Approximation讀者反饋
書目名稱Complexity and Approximation讀者反饋學(xué)科排名
作者: fluoroscopy 時間: 2025-3-21 23:39 作者: 專橫 時間: 2025-3-22 03:22 作者: nutrients 時間: 2025-3-22 08:16
Approximation through Randomization, many problems arising in different areas: taking into account the scope of this book, however, we will limit ourselves to considering randomized approximation algorithms for N.-hard optimization problems.作者: 打擊 時間: 2025-3-22 12:38 作者: compel 時間: 2025-3-22 15:08 作者: compel 時間: 2025-3-22 19:49 作者: 持久 時間: 2025-3-22 21:13
Heuristic methods,gorithms with a guaranteed behaviour, where such a guarantee refers both to the quality of the returned solution (in terms of either worst case or expected performance ratio) and to the running time (polynomial either in the worst or in the average case).作者: decipher 時間: 2025-3-23 03:06
https://doi.org/10.1007/978-3-642-58412-1Approximation; Combinatorial Algorithms; Complexity; Computer; Partition; Scheduling; Variable; calculus; co作者: 輕而薄 時間: 2025-3-23 09:33 作者: 金盤是高原 時間: 2025-3-23 10:33 作者: 運動的我 時間: 2025-3-23 14:53
http://image.papertrans.cn/c/image/231659.jpg作者: 記憶 時間: 2025-3-23 21:32
J. David Alvis,Jason R. Jividen many problems arising in different areas: taking into account the scope of this book, however, we will limit ourselves to considering randomized approximation algorithms for N.-hard optimization problems.作者: Apogee 時間: 2025-3-24 01:50
J. David Alvis,Jason R. Jividenecise machine-based characterization that will be used in Sect. 6.3 to develop the notion of . (in short, PCP). In Sect. 6.4 we will see how probabilistically checkable proofs can be used in a rather surprising way to show non-approximability results for N.-hard optimization problems.作者: 遠(yuǎn)足 時間: 2025-3-24 03:06
Fostering Statesmanship in Public Life,of a P. result, we first show that any NP problem admits long (that is, exponential) proofs which can be verified with a constant number of queries. To this aim we introduce the arithmetization of a Boolean formula and we make use of some properties of linear functions.作者: 使人入神 時間: 2025-3-24 07:04 作者: doxazosin 時間: 2025-3-24 11:53
The Regime for Bank Regulation,IN THE preceding chapter we observed that many relevant optimization problems are N.-hard, and that it is unlikely that we will ever be able to find efficient (i.e., polynomial-time) algorithms for their solution. In such cases it is worth looking for algorithms that always return a feasible solution whose measure is not too far from the optimum.作者: delta-waves 時間: 2025-3-24 16:44 作者: 兵團(tuán) 時間: 2025-3-24 20:28 作者: 似少年 時間: 2025-3-25 00:53 作者: 松軟 時間: 2025-3-25 06:03 作者: charisma 時間: 2025-3-25 10:12 作者: antenna 時間: 2025-3-25 13:28 作者: 遺傳 時間: 2025-3-25 17:39
Heuristic methods,gorithms with a guaranteed behaviour, where such a guarantee refers both to the quality of the returned solution (in terms of either worst case or expected performance ratio) and to the running time (polynomial either in the worst or in the average case).作者: exacerbate 時間: 2025-3-25 20:54
The Regime for Securities Regulation,ant to solve by computer may have quite varying characteristics. In general, we are able to express our problem in terms of some .? ., where I is the set of . and . is the set of .. As an alternative view, we can also consider a predicate .(x,y) which is true if and only if (x,y) ∈ .. If we want to 作者: Blood-Clot 時間: 2025-3-26 01:16
https://doi.org/10.1057/9781403981011unless P = N.. Therefore, if we want to solve an N.-hard optimiza-tion problem by means of an efficient (polynomial-time) algorithm, we have to accept the fact that the algorithm does not always return an optimal solution but rather an approximate one. In Chap. 2, we have seen that, in some cases, s作者: sclera 時間: 2025-3-26 05:13
Paul Kingston,Marie-Joelle Zahartant factor. We also saw examples of N. problems for which no approximation algorithm exists (unless P=N.) and examples of N. problems for which an approximation algorithm but no approxima-tion scheme exists (unless P=N.). To deal with these two latter kinds of problem, in this chapter we will relax作者: 鎮(zhèn)壓 時間: 2025-3-26 11:45
J. David Alvis,Jason R. Jividen many problems arising in different areas: taking into account the scope of this book, however, we will limit ourselves to considering randomized approximation algorithms for N.-hard optimization problems.作者: 摻假 時間: 2025-3-26 16:12 作者: 打谷工具 時間: 2025-3-26 19:09 作者: 煩躁的女人 時間: 2025-3-27 00:01 作者: glacial 時間: 2025-3-27 02:09 作者: Pepsin 時間: 2025-3-27 05:19
Textbook 1999 solution, because it might require months or years of machine time, even with the help of powerful parallel computers. In such cases, we may decide to restrict ourselves to compute a solution that, though not being an optimal one, nevertheless is close to the optimum and may be determined in polyno作者: Analogy 時間: 2025-3-27 11:45
uire months or years of machine time, even with the help of powerful parallel computers. In such cases, we may decide to restrict ourselves to compute a solution that, though not being an optimal one, nevertheless is close to the optimum and may be determined in polyno978-3-642-63581-6978-3-642-58412-1作者: 描繪 時間: 2025-3-27 14:46 作者: 沒收 時間: 2025-3-27 17:47 作者: Blemish 時間: 2025-3-28 01:44 作者: FEAT 時間: 2025-3-28 04:34
The Regime for Securities Regulation,set of . and . is the set of .. As an alternative view, we can also consider a predicate .(x,y) which is true if and only if (x,y) ∈ .. If we want to analyze the properties of the computations to be performed, it is necessary to consider the characteristics of the sets ., . and of the relation . (or of the predicate .) more closely.作者: 痛打 時間: 2025-3-28 08:35 作者: Anemia 時間: 2025-3-28 12:52
Fostering Statesmanship in Public Life,eductions not always preserve the measure function and, even if this happens, they rarely preserve the quality of the solutions. It is then clear that a stronger kind of reducibility has to be used that not only maps instances of a problem .. to instances of a problem .., but it also maps back good solutions for .. to good solutions for ...作者: bronchiole 時間: 2025-3-28 16:19
The Complexity of Optimization Problems,set of . and . is the set of .. As an alternative view, we can also consider a predicate .(x,y) which is true if and only if (x,y) ∈ .. If we want to analyze the properties of the computations to be performed, it is necessary to consider the characteristics of the sets ., . and of the relation . (or of the predicate .) more closely.作者: 隱士 時間: 2025-3-28 20:22
Input-Dependent and Asymptotic Approximation,proximation algorithm but no approxima-tion scheme exists (unless P=N.). To deal with these two latter kinds of problem, in this chapter we will relax the constraint on the performance ratio in two ways.作者: profligate 時間: 2025-3-29 00:47
Approximation Preserving Reductions,eductions not always preserve the measure function and, even if this happens, they rarely preserve the quality of the solutions. It is then clear that a stronger kind of reducibility has to be used that not only maps instances of a problem .. to instances of a problem .., but it also maps back good solutions for .. to good solutions for ...作者: 斜 時間: 2025-3-29 05:47
