標(biāo)題: Titlebook: Approximation Algorithms for Combinatorial Optimization; International Worksh Klaus Jansen,José Rolim Conference proceedings 1998 Springer- [打印本頁(yè)] 作者: 哥哥大傻瓜 時(shí)間: 2025-3-21 18:23
書目名稱Approximation Algorithms for Combinatorial Optimization影響因子(影響力)
書目名稱Approximation Algorithms for Combinatorial Optimization影響因子(影響力)學(xué)科排名
書目名稱Approximation Algorithms for Combinatorial Optimization網(wǎng)絡(luò)公開度
書目名稱Approximation Algorithms for Combinatorial Optimization網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Approximation Algorithms for Combinatorial Optimization被引頻次
書目名稱Approximation Algorithms for Combinatorial Optimization被引頻次學(xué)科排名
書目名稱Approximation Algorithms for Combinatorial Optimization年度引用
書目名稱Approximation Algorithms for Combinatorial Optimization年度引用學(xué)科排名
書目名稱Approximation Algorithms for Combinatorial Optimization讀者反饋
書目名稱Approximation Algorithms for Combinatorial Optimization讀者反饋學(xué)科排名
作者: intelligible 時(shí)間: 2025-3-22 00:11
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/160383.jpg作者: Chronic 時(shí)間: 2025-3-22 03:02
Using linear programming in the design and analysis of approximation algorithms: Two illustrative pion in order to compute a near-optimal solution to the problem at hand. We shall survey recent work in this vein for two particular problems: the uncapacitated facility location problem and the problem of scheduling precedence-constrained jobs on one machine so as to minimize a weighted average of their completion times.作者: inhumane 時(shí)間: 2025-3-22 07:52 作者: 污點(diǎn) 時(shí)間: 2025-3-22 12:48
A new fully polynomial approximation scheme for the knapsack problem,ary space requirements. The two best previously known approaches need .(. + 1/?.) and .(.·l/?) space, respectively. Our new approximation scheme requires only .(. + 1/?.) space while also reducing the running time.作者: Fracture 時(shí)間: 2025-3-22 16:17
Approximating circular arc colouring and bandwidth allocation in all-optical ring networks,domized approximation algorithm for the arc colouring problem, an improvement over the best previously known performance ratio of 5/3. For the problem of allocating bandwidth in an all-optical . ring network, we present a factor-of-(1.5+1/2.+.(1)) randomized approximation algorithm, improving upon the best previously known performance ratio of 2.作者: 倒轉(zhuǎn) 時(shí)間: 2025-3-22 20:33 作者: 情愛(ài) 時(shí)間: 2025-3-22 22:32 作者: placebo 時(shí)間: 2025-3-23 03:33 作者: 專橫 時(shí)間: 2025-3-23 09:24 作者: epicardium 時(shí)間: 2025-3-23 10:46
Approximation Algorithms for Combinatorial Optimization978-3-540-69067-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 形狀 時(shí)間: 2025-3-23 14:01 作者: 口音在加重 時(shí)間: 2025-3-23 20:37 作者: 廢止 時(shí)間: 2025-3-23 23:25 作者: 束縛 時(shí)間: 2025-3-24 04:17 作者: GEN 時(shí)間: 2025-3-24 08:10
https://doi.org/10.1007/BFb0053958Approximation Algorithms; Combinatorial Optimization; Complexity Classes; Erfüllbarkeitsproblem der Aus作者: Fibrin 時(shí)間: 2025-3-24 13:54 作者: 策略 時(shí)間: 2025-3-24 16:11
,Realisierung der Prüfstrategie,ion in order to compute a near-optimal solution to the problem at hand. We shall survey recent work in this vein for two particular problems: the uncapacitated facility location problem and the problem of scheduling precedence-constrained jobs on one machine so as to minimize a weighted average of t作者: 食品室 時(shí)間: 2025-3-24 21:42 作者: onlooker 時(shí)間: 2025-3-25 00:43
https://doi.org/10.1007/978-3-322-81376-3ion algorithms for the following problems: Vertex Cover, Set Cover, Feedback Vertex Set, Generalized Steiner Forest and related problems..The main idea can be phrased as follows: iteratively, pay two dollars (at most) to reduce the total optimum by one dollar (at least), so the rate of payment is no作者: 刻苦讀書 時(shí)間: 2025-3-25 04:51 作者: ironic 時(shí)間: 2025-3-25 09:10 作者: Graduated 時(shí)間: 2025-3-25 14:48 作者: TOXIN 時(shí)間: 2025-3-25 19:15 作者: Exposition 時(shí)間: 2025-3-25 22:49 作者: Acclaim 時(shí)間: 2025-3-26 01:07 作者: profligate 時(shí)間: 2025-3-26 05:21
https://doi.org/10.1007/978-3-8350-9627-1e distance between any two vertices in . is larger than that distance in . by no more than a factor of .. This paper concerns the hardness of finding spanners with the number of edges close to the optimum. It is proved that for every fixed . approximating the spanner problem is at least as hard as a作者: 透明 時(shí)間: 2025-3-26 10:16 作者: 新鮮 時(shí)間: 2025-3-26 16:20 作者: 疾馳 時(shí)間: 2025-3-26 19:24 作者: acrimony 時(shí)間: 2025-3-27 01:01
Erfolgsfaktoren im Stiftungsmanagement is known to be .-hard, but its approximation complexity is not known. For the general problem only an approximation ratio of ?(n.) has been proved (Kortsarz and Peleg (1993)). In the last years several authors analyzed the case .. In this case Asahiro et al. (1996) showed a constant factor approxim作者: REP 時(shí)間: 2025-3-27 02:10 作者: 得意牛 時(shí)間: 2025-3-27 05:46 作者: 一回合 時(shí)間: 2025-3-27 12:11
Lower bounds for on-line scheduling with precedence constraints on identical machines,deterministic algorithms with preemption, and a lower bound of 2 ? O(1/.) on the competitive ratio of any randomized algorithm with preemption. All the lower bounds hold even for sequences of unit jobs only. The best algorithm that is known for this problem is the well known List Scheduling algorith作者: obeisance 時(shí)間: 2025-3-27 16:01
Instant recognition of half integrality and 2-approximations,ver..Problems that are amenable to the analysis provided here are easily recognized. The analysis itself is entirely technical and involves manipulating the constraints and transforming them to a totally unimodular system while losing no more than a factor of 2 in the integrality.作者: 拾落穗 時(shí)間: 2025-3-27 20:47 作者: 薄膜 時(shí)間: 2025-3-28 01:31 作者: 無(wú)能力之人 時(shí)間: 2025-3-28 05:52
https://doi.org/10.1007/978-3-8350-9627-1ver..Problems that are amenable to the analysis provided here are easily recognized. The analysis itself is entirely technical and involves manipulating the constraints and transforming them to a totally unimodular system while losing no more than a factor of 2 in the integrality.作者: 憤慨點(diǎn)吧 時(shí)間: 2025-3-28 09:17 作者: cortisol 時(shí)間: 2025-3-28 11:56 作者: 共同給與 時(shí)間: 2025-3-28 18:04 作者: 談判 時(shí)間: 2025-3-28 19:37 作者: 業(yè)余愛(ài)好者 時(shí)間: 2025-3-28 23:11 作者: MIR 時(shí)間: 2025-3-29 04:42
Lower bounds for on-line scheduling with precedence constraints on identical machines,ement, and may depend on other jobs (has to be processed after them). A job arrives only after its predecessors have been completed. The cost of an algorithm is the time that the last job is completed. We show lower bounds on the competitive ratio of on-line algorithms for this problem in several ve作者: 名次后綴 時(shí)間: 2025-3-29 08:15
Instant recognition of half integrality and 2-approximations, form . ≤ ., where the variable . appears only in that constraint. For such binary integer programs it is possible to derive half integral superoptimal solutions in polynomial time. The scheme is also applicable with few modifications to nonbinary integer problems. For some of these problems it is p作者: 出生 時(shí)間: 2025-3-29 11:44
The ,-vertex cover problem: Extending the half integrality framework with budget constraints,half integral solution to such problems. These solutions can be used under certain conditions to generate 2-approximations. Here we extend these results to problems involving budget constraints that do not conform to the structure of that class. Specifically, we address the .-vertex cover problem re作者: 的闡明 時(shí)間: 2025-3-29 17:18 作者: 憤世嫉俗者 時(shí)間: 2025-3-29 23:36 作者: BAIT 時(shí)間: 2025-3-30 01:16
Approximating circular arc colouring and bandwidth allocation in all-optical ring networks,domized approximation algorithm for the arc colouring problem, an improvement over the best previously known performance ratio of 5/3. For the problem of allocating bandwidth in an all-optical . ring network, we present a factor-of-(1.5+1/2.+.(1)) randomized approximation algorithm, improving upon t作者: 極深 時(shí)間: 2025-3-30 05:53 作者: 兩棲動(dòng)物 時(shí)間: 2025-3-30 08:40 作者: GREEN 時(shí)間: 2025-3-30 12:43 作者: conscribe 時(shí)間: 2025-3-30 17:17 作者: 高爾夫 時(shí)間: 2025-3-31 00:08 作者: Insensate 時(shí)間: 2025-3-31 03:13 作者: Glower 時(shí)間: 2025-3-31 05:53
Approximating maximum independent set in k-clique-free graphs,). log(ˉ.(. ? 2).) ? ˉ.(. ? 2). + 1)/(ˉ.(. ? 2). ? 1). for ˉ. ≥ 2..For graphs with moderate maximum degree Halldórsson and J. Radhakrishnan.For graphs with moderate to large values of . Halldórsson and J. Radhakrishnan作者: LINE 時(shí)間: 2025-3-31 12:26 作者: 猛烈責(zé)罵 時(shí)間: 2025-3-31 16:31
Conference proceedings 1998zation techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.作者: VEIL 時(shí)間: 2025-3-31 21:27
