標(biāo)題: Titlebook: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques; 4th International Wo Michel Goemans,Klaus Jansen,Lu [打印本頁] 作者: ACID 時(shí)間: 2025-3-21 19:08
書目名稱Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques影響因子(影響力)
書目名稱Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques影響因子(影響力)學(xué)科排名
書目名稱Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques網(wǎng)絡(luò)公開度
書目名稱Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques被引頻次
書目名稱Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques被引頻次學(xué)科排名
書目名稱Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques年度引用
書目名稱Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques年度引用學(xué)科排名
書目名稱Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques讀者反饋
書目名稱Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques讀者反饋學(xué)科排名
作者: objection 時(shí)間: 2025-3-21 21:46
Error-Correcting Codes and Pseudorandom Projectionsthe following notation: if . = (..,..., ..) ∈ {0, 1}. and . = {..,...,.. ? [.], with .. < .. <... < .. then . = (..,y.,..., y.) ∈ {0,1}.. Then we can define a family of hash functions where each function of our family is indexed by a subset . of size m, and ..(x) = C(x)|...It is immediate to see tha作者: NORM 時(shí)間: 2025-3-22 03:41
An Online Algorithm for the Postman Problem with a Small Penalty the existence of . before traversing the edge .. We devised an algorithm for The Corridor Model whose penalty is bounded by 2| .| - 2. It performs better than the algorithm described in [.], in the case when the other visited endpoint of an edge from a current vertex is known to the postman. In add作者: Pcos971 時(shí)間: 2025-3-22 06:08 作者: moratorium 時(shí)間: 2025-3-22 10:58
Approximation Algorithms for Budget-Constrained Auctionsion to obtain a fractional optimal solution, which is then deterministically rounded to obtain an integer solution. We argue that the loss in revenue incurred by the rounding procedure is bounded by a factor of 1.62.作者: Aesthete 時(shí)間: 2025-3-22 16:14 作者: 面包屑 時(shí)間: 2025-3-22 17:40 作者: indecipherable 時(shí)間: 2025-3-23 01:17 作者: flimsy 時(shí)間: 2025-3-23 03:19
Mohit Gaur,M. Muzammil,Abid Ali Khan the existence of . before traversing the edge .. We devised an algorithm for The Corridor Model whose penalty is bounded by 2| .| - 2. It performs better than the algorithm described in [.], in the case when the other visited endpoint of an edge from a current vertex is known to the postman. In add作者: AER 時(shí)間: 2025-3-23 09:08
https://doi.org/10.1007/978-1-349-21671-0g space ... For the interval [0,1] we construct an optimal (infinite) code of competitive ratio ln 4 ≈ 1.386. For the Hamming space .. (where the generic 2-competitive constructive is not efficient), we show the following. If |.| ≥., we construct optimal (and efficient) 1-competitive code that exhau作者: 使顯得不重要 時(shí)間: 2025-3-23 10:24 作者: Longitude 時(shí)間: 2025-3-23 14:22
Ergonomics for Improved Productivitys in combinatorial optimization, and have relaxed these to unit vectors in real space using semidefinite programming in order to obtain near optimal solutions to these problems. In this talk, we consider using the cube roots of unity, 1, .., and .., to represent ternary decision variables for proble作者: occult 時(shí)間: 2025-3-23 20:33
Anirban Chowdhury,Chaitanya Kachareistributions of instances really are, whether these distributions are mathematically defined or come from real-world applications. Frequently, NP-complete problems have been successfully attacked on “typical” instances using heuristic methods. Little is known about when or why some of these heuristi作者: probate 時(shí)間: 2025-3-23 22:26 作者: Infinitesimal 時(shí)間: 2025-3-24 02:53
Ergonomical Evaluation of Knapsack Sprayer,he same principle: encode the “input1.” using an error-correcting code, select a random (or pseudorandom) subset of the bits of the encoding, and output the encoded codeword restricted to such bits. This general approach is common to constructions of very different combinatorial objects, and somewha作者: 合適 時(shí)間: 2025-3-24 09:55
Dhananjay Ikhar,Vishwas Deshpandel of these objects are “pseudorandom” in some sense, it is not surprising that constructions of one of these objects may be useful in constructing another. Indeed, there are many examples of this in the past, which we do not attempt to summarize here. Instead, we focus on how recent works show that 作者: 剝皮 時(shí)間: 2025-3-24 10:59 作者: 朝圣者 時(shí)間: 2025-3-24 18:06 作者: encyclopedia 時(shí)間: 2025-3-24 22:10 作者: 意外 時(shí)間: 2025-3-25 00:48 作者: 善于 時(shí)間: 2025-3-25 05:33 作者: CYN 時(shí)間: 2025-3-25 10:03 作者: Lethargic 時(shí)間: 2025-3-25 15:37 作者: 母豬 時(shí)間: 2025-3-25 19:44
https://doi.org/10.1007/978-1-349-21671-0 other by the popularity of Internet auctions and the possibility of new auction formats enabled by e-commerce. Simultaneous auction of items is a popular auction format. We consider the problem of maximizing total revenue in the simultaneous auction of a set of items where the bidders have individu作者: GUISE 時(shí)間: 2025-3-25 22:00 作者: 笨重 時(shí)間: 2025-3-26 02:29 作者: 狂熱語言 時(shí)間: 2025-3-26 07:17 作者: 舊石器時(shí)代 時(shí)間: 2025-3-26 10:23 作者: Interregnum 時(shí)間: 2025-3-26 14:18 作者: Matrimony 時(shí)間: 2025-3-26 17:23
https://doi.org/10.1007/3-540-44666-4Partition; algorithms; analysis; combinatorial optimization; complexity; complexity theory; computational 作者: Sarcoma 時(shí)間: 2025-3-26 20:59 作者: 正式通知 時(shí)間: 2025-3-27 04:57 作者: 忘恩負(fù)義的人 時(shí)間: 2025-3-27 08:02
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Techniquech approach, which extend known frameworks for covering problems. We show that the two are equivalent, and conclude that the integrality gap of an integer program serves as a bound to the approximation ratio when working with the local-ratio technique.作者: 拖債 時(shí)間: 2025-3-27 12:03 作者: 愛好 時(shí)間: 2025-3-27 15:34 作者: Assignment 時(shí)間: 2025-3-27 18:00
A Simple Dual Ascent Algorithm for the Multilevel Facility Location ProblemWe present a simple dual ascent method for the multilevel facility location problem which finds a solution within 6 times the optimum for the uncapacitated case and within 12 times the optimum for the capacitated one. The algorithm is deterministic and based on the primal-dual technique.作者: 態(tài)學(xué) 時(shí)間: 2025-3-28 00:58
Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques978-3-540-44666-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: misanthrope 時(shí)間: 2025-3-28 04:09
Anirban Chowdhury,Chaitanya Kachareistributions of instances really are, whether these distributions are mathematically defined or come from real-world applications. Frequently, NP-complete problems have been successfully attacked on “typical” instances using heuristic methods. Little is known about when or why some of these heuristics succeed.作者: Acetaldehyde 時(shí)間: 2025-3-28 07:44 作者: 靈敏 時(shí)間: 2025-3-28 12:42 作者: assail 時(shí)間: 2025-3-28 17:01
Michel Goemans,Klaus Jansen,Luca TrevisanIncludes supplementary material: 作者: 收集 時(shí)間: 2025-3-28 22:05 作者: Cougar 時(shí)間: 2025-3-29 00:24 作者: inflame 時(shí)間: 2025-3-29 03:13 作者: CULP 時(shí)間: 2025-3-29 08:07 作者: HAIL 時(shí)間: 2025-3-29 11:44
Stress, Fatigue and the Working Environment,plete bipartite graph between cities and facilities. We use our algorithm to improve recent results for some variants of the problem, such as the fault tolerant and outlier versions. In addition, we introduce a new variant which can be seen as a special case of the concave cost version of this problem.作者: 引起 時(shí)間: 2025-3-29 18:02
Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flowsnetwork, can be solved using combinatorial techniques. Moreover, for parallel disk systems, we develop improved approximation algorithms, trading performance guarantee for running time. If the number of disks is constant, we achieve a 2-approximation.作者: Transfusion 時(shí)間: 2025-3-29 19:53
Online Weighted Flow Time and Deadline Schedulingof the jobs unfinished by some unknown deadline . on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for Deadline Scheduling. We finally give an .(1)-competitive algorithm for Deadline Scheduling.作者: 易改變 時(shí)間: 2025-3-30 00:39 作者: Arthr- 時(shí)間: 2025-3-30 08:07
Conference proceedings 2001alysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.作者: SAGE 時(shí)間: 2025-3-30 08:54 作者: 憂傷 時(shí)間: 2025-3-30 12:41 作者: 體貼 時(shí)間: 2025-3-30 16:59
Approximation Schemes for Ordered Vector Packing Problemsant Dilworth number, i.e. instances where the set of items can be partitioned into a constant number of totally ordered subsets. We use ideas from classical and recent approximation schemes for related problems, as well as a nontrivial procedure to round an LP solution associated with the packing of the small items.作者: 項(xiàng)目 時(shí)間: 2025-3-30 23:01 作者: overbearing 時(shí)間: 2025-3-31 02:51
The Maximum Acyclic Subgraph Problem and Degree-3 Graphsproximation algorithm for the maximum acyclic subgraph problem in graphs with maximum degree 3, then there is a (1/2 + δ)-approximation algorithm for general graphs for some δ > 0. The problem of finding a better-than-half approximation for general graphs is open.作者: 裂縫 時(shí)間: 2025-3-31 08:51 作者: 粗鄙的人 時(shí)間: 2025-3-31 12:21
Ergonomische Arbeitsmittelgestaltung,proximation algorithm for the maximum acyclic subgraph problem in graphs with maximum degree 3, then there is a (1/2 + δ)-approximation algorithm for general graphs for some δ > 0. The problem of finding a better-than-half approximation for general graphs is open.作者: 條街道往前推 時(shí)間: 2025-3-31 15:29 作者: 深陷 時(shí)間: 2025-3-31 18:39
Accidents, Errors and Interfaces,We then consider the problem of scheduling non-preemptively tasks (of non-uniform lengths) that require exclusive use of dedicated processors. The objective is to minimize the sum of completion times. We obtain the first constant factor approximations for this problem, when each task uses a constant number of processors.作者: 貪婪性 時(shí)間: 2025-4-1 00:11 作者: 賄賂 時(shí)間: 2025-4-1 05:54
Gernot Maier,Willibald Rabenhauptnown to be .-hard. It was introduced by Hein et al. [.], who presented an approximation algorithm for it, claimed to have approximation ratio 3. We present here a 3-approximation algorithm for this problem and show that the performance ratio of Hein’s algorithm is 4.作者: Definitive 時(shí)間: 2025-4-1 07:13 作者: affluent 時(shí)間: 2025-4-1 11:15
Minimizing Average Completion of Dedicated Tasks and Interval GraphsWe then consider the problem of scheduling non-preemptively tasks (of non-uniform lengths) that require exclusive use of dedicated processors. The objective is to minimize the sum of completion times. We obtain the first constant factor approximations for this problem, when each task uses a constant number of processors.作者: erythema 時(shí)間: 2025-4-1 15:27
0.863-Approximation Algorithm for MAX DICUT in the class, we can design a skewed distribution functions on any dimensional sphere without decreasing the approximation ratio. We also searched and found a good distribution function defined on the 2-dimensional sphere numerically.作者: Trigger-Point 時(shí)間: 2025-4-1 19:26
Some Approximation Results for the Maximum Agreement Forest Problemnown to be .-hard. It was introduced by Hein et al. [.], who presented an approximation algorithm for it, claimed to have approximation ratio 3. We present here a 3-approximation algorithm for this problem and show that the performance ratio of Hein’s algorithm is 4.作者: organism 時(shí)間: 2025-4-2 01:42 作者: Hangar 時(shí)間: 2025-4-2 03:14
Using Complex Semidefinite Programming for Approximating MAX E2-LIN3s in combinatorial optimization, and have relaxed these to unit vectors in real space using semidefinite programming in order to obtain near optimal solutions to these problems. In this talk, we consider using the cube roots of unity, 1, .., and .., to represent ternary decision variables for proble作者: antiquated 時(shí)間: 2025-4-2 08:15
