標(biāo)題: Titlebook: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques; 6th International Wo Sanjeev Arora,Klaus Jansen,Am [打印本頁(yè)] 作者: Weber-test 時(shí)間: 2025-3-21 16:04
書(shū)目名稱(chēng)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques影響因子(影響力)
書(shū)目名稱(chēng)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques被引頻次
書(shū)目名稱(chēng)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques被引頻次學(xué)科排名
書(shū)目名稱(chēng)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques年度引用
書(shū)目名稱(chēng)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques年度引用學(xué)科排名
書(shū)目名稱(chēng)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques讀者反饋
書(shū)目名稱(chēng)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques讀者反饋學(xué)科排名
作者: 擋泥板 時(shí)間: 2025-3-21 22:21
Conference proceedings 2003and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications..作者: surmount 時(shí)間: 2025-3-22 04:05 作者: 吹牛大王 時(shí)間: 2025-3-22 08:29 作者: Integrate 時(shí)間: 2025-3-22 09:28
Bernhard Zimolong,Gabriele Elkeut for undirected graphs its complexity status is not known: no polynomial algorithm is known, and it is also not known to be NP-hard. For undirected graphs with the input graph . being (.-1)-connected from . to ., we give an algorithm that computes a solution of size exceeding a lower bound of the optimum by at most (.-1)/2 edges.作者: 聯(lián)想 時(shí)間: 2025-3-22 14:26
A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problemlity location problem, using a single factor-revealing LP. This answers an open question of [16]Furthermore, this analysis, combined with a recent result of Thorup [21] shows that our algorithm can be implemented in quasi-linear time, achieving the best known approximation factor in the best possible running time.作者: Itinerant 時(shí)間: 2025-3-22 20:44 作者: 襲擊 時(shí)間: 2025-3-22 23:22
Arne Aar?s,G. Horgen,M. Hellandgraphs excluding any minor of size ., the multicommodity max-flow min-cut ratio is at most .(..) (for the uniform demand case). This also improves the performance guarantees of several applications of the decomposition theorem.作者: 思想 時(shí)間: 2025-3-23 02:43
éric Brangier,Sonia Hammes-Adelé . variant each vertex must have . (unweighted) centers nearby: we give an .(log..)-bicriteria algorithm using 2. centers, for small ...Finally, the following three versions of the asymmetric .-center problem we show to be inapproximable: .-center, ., and ..作者: flamboyant 時(shí)間: 2025-3-23 07:06 作者: Detoxification 時(shí)間: 2025-3-23 10:16
Richard E. A. van Emmerik,Karl M. Newellde a performance guarantee regardless of the nature of the incoming traffic. Thus, the adversarial input model provides a valuable, complementary point of view to that of the more traditional stochastic model.作者: dagger 時(shí)間: 2025-3-23 14:22
Jothee Sinnakkannu,Ananda Samudhraml considered. In some natural models the answer is false and in others the answer is true. Our positive results for the third question exhibit models in which the “hybrid argument bottleneck” in “moving from a distinguisher to a predictor” can be avoided.作者: 無(wú)底 時(shí)間: 2025-3-23 21:11 作者: 芭蕾舞女演員 時(shí)間: 2025-3-24 00:55
Asymmetry in ,-Center Variants . variant each vertex must have . (unweighted) centers nearby: we give an .(log..)-bicriteria algorithm using 2. centers, for small ...Finally, the following three versions of the asymmetric .-center problem we show to be inapproximable: .-center, ., and ..作者: offense 時(shí)間: 2025-3-24 02:22 作者: 割讓 時(shí)間: 2025-3-24 06:32 作者: 表示向前 時(shí)間: 2025-3-24 11:32
Computational Analogues of Entropyl considered. In some natural models the answer is false and in others the answer is true. Our positive results for the third question exhibit models in which the “hybrid argument bottleneck” in “moving from a distinguisher to a predictor” can be avoided.作者: prosperity 時(shí)間: 2025-3-24 18:44
Conference proceedings 20032003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003...The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design 作者: Arb853 時(shí)間: 2025-3-24 21:48 作者: Felicitous 時(shí)間: 2025-3-25 00:10 作者: 救護(hù)車(chē) 時(shí)間: 2025-3-25 03:44 作者: deadlock 時(shí)間: 2025-3-25 11:22
Wei-Ying Chou,Bi-Hui Chen,Wen-Ko ChiouThis improves the previous factor of . by Trevisan [Tre01]. For low . values we prove NP-hardness factors of . and . for 4-DM, 5-DM and 6-DM respectively. These results extend to the problem of .-Set-Packing and the problem of Maximum Independent-Set in (.+1)-claw-free graphs.作者: Obvious 時(shí)間: 2025-3-25 13:12 作者: GULP 時(shí)間: 2025-3-25 17:44 作者: endocardium 時(shí)間: 2025-3-25 23:38
Covering Graphs Using Trees and Starshas no more than . trees. Star covers are defined analogously. Additionally, we may also be provided with a set of . vertices which are to serve as roots of the trees or stars. In this paper, we provide constant factor approximation algorithms for finding tree and star covers of graphs, in the rooted and un-rooted versions.作者: 令人作嘔 時(shí)間: 2025-3-26 00:41 作者: Small-Intestine 時(shí)間: 2025-3-26 04:56
Approximating Market Equilibriaprice vector. The main tool in our algorithm is the polynomial-time algorithm of Devanur et al. [6] for a variant of the problem in which there is a clear demarcation between buyers and sellers. Their algorithm is used as a subroutine in our algorithm.作者: 大洪水 時(shí)間: 2025-3-26 11:01 作者: Rotator-Cuff 時(shí)間: 2025-3-26 16:33 作者: 不可比擬 時(shí)間: 2025-3-26 20:25 作者: ASTER 時(shí)間: 2025-3-26 21:17
Lecture Notes in Computer ScienceWe show that it is NP-hard to .-approximate the integral of a positive, smooth, polynomial-time computable .-variate function, for any fixed integer ..作者: 聯(lián)想記憶 時(shí)間: 2025-3-27 04:05
Approximating the Degree-Bounded Minimum Diameter Spanning Tree ProblemWe consider the problem of finding a minimum diameter spanning tree with maximum node degree . in a complete undirected edge-weighted graph. We prove that the problem is NP-complete, and provide an .-approximation algorithm for the problem. Our algorithm is purely combinatorial, and relies on a combination of . and ..作者: 加強(qiáng)防衛(wèi) 時(shí)間: 2025-3-27 08:08 作者: emission 時(shí)間: 2025-3-27 13:07
https://doi.org/10.1007/b11961algorithm; algorithms; combinatorial optimization; complexity; complexity theory; computer; computer scien作者: PLAYS 時(shí)間: 2025-3-27 17:04 作者: 慷慨不好 時(shí)間: 2025-3-27 20:08 作者: 濃縮 時(shí)間: 2025-3-27 23:43
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/160465.jpg作者: 減少 時(shí)間: 2025-3-28 03:24 作者: 珊瑚 時(shí)間: 2025-3-28 06:34 作者: 圓柱 時(shí)間: 2025-3-28 12:18
https://doi.org/10.1007/978-94-009-5878-4nimize the total absolute weight of cut positive edges and uncut negative edges. Thus, large positive weights (representing strong correlations between endpoints) encourage those endpoints to belong to a common cluster; large negative weights encourage the endpoints to belong to different clusters; 作者: 空氣 時(shí)間: 2025-3-28 16:21 作者: Handedness 時(shí)間: 2025-3-28 21:29
https://doi.org/10.1007/978-94-009-5878-4ight of the maximum weight tree in the tree cover. Given a positive integer ., the .-tree cover problem is to compute a minimum cost tree cover which has no more than . trees. Star covers are defined analogously. Additionally, we may also be provided with a set of . vertices which are to serve as ro作者: 橢圓 時(shí)間: 2025-3-29 01:31
Arne Aar?s,G. Horgen,M. Hellanddes a .. minor, Klein, Plotkin and Rao [15] showed that this can be done while cutting only .(../.) fraction of the edges. This implies a bound on multicommodity max-flow min-cut ratio for such graphs. This result as well as the decomposition theorem have found numerous applications to approximation作者: transplantation 時(shí)間: 2025-3-29 06:33
Arne Aar?s,G. Horgen,M. Hellandthms. The problems considered have the property that the space occupied by a collection of objects together could be significantly less than the sum of the sizes of the individual objects. In the ., there are users who request subsets of items. There are a fixed number of channels that can carry an 作者: tenosynovitis 時(shí)間: 2025-3-29 09:05
éric Brangier,Sonia Hammes-Adelém, similar to the .-median problem. Variants of .-center may more accurately model real-life problems than the original formulation. Asymmetry is a significant impediment to approximation in many graph problems, such as .-center, facility location, .-median and the TSP..We demonstrate an .(log..)-ap作者: 偶然 時(shí)間: 2025-3-29 11:38
Wei-Ying Chou,Bi-Hui Chen,Wen-Ko Chiouin minimal time. In the setting of flows over time, flow on arcs may vary over time and the transit time of an arc is the time it takes for flow to travel through this arc. In most real-world applications (such as, e.g., road traffic, communication networks, production systems, etc.), transit times 作者: concise 時(shí)間: 2025-3-29 16:25
Wei-Ying Chou,Bi-Hui Chen,Wen-Ko Chioul matching in a k-partite k-uniform balanced hyper-graph. We prove that k-DM cannot be efficiently approximated to within a factor of . unless . = .. This improves the previous factor of . by Trevisan [Tre01]. For low . values we prove NP-hardness factors of . and . for 4-DM, 5-DM and 6-DM respectiv作者: DUCE 時(shí)間: 2025-3-29 19:57
Michelle Robertson,Emily Huang,Nancy Larsoneng, Papadimitriou and Safra [5]. Using this notion, we present the first fully polynomial-time approximation scheme for finding a market equilibrium price vector. The main tool in our algorithm is the polynomial-time algorithm of Devanur et al. [6] for a variant of the problem in which there is a c作者: LARK 時(shí)間: 2025-3-30 03:17
Bernhard Zimolong,Gabriele Elkeon problem. This achieves the integrality gap of the natural LP relaxation of the problem. The algorithm is based on an improved analysis of an algorithm for the linear facility location problem, and a . approximate-reduction from this problem to the soft-capacitated facility location problem. We wi作者: follicular-unit 時(shí)間: 2025-3-30 06:12 作者: pericardium 時(shí)間: 2025-3-30 12:04 作者: 仔細(xì)檢查 時(shí)間: 2025-3-30 12:24 作者: attenuate 時(shí)間: 2025-3-30 20:18
An Overview Of Cognitive Psychologys in ... The goal is to compute the .. of ., denoted by ..(.), which is the minimum, over all (.-.)-dimensional flats ., of max ..(.,.), where .(.,.) is the Euclidean distance between the point . and flat .. Computing the radii of point sets is a fundamental problem in computational convexity with s作者: ADOPT 時(shí)間: 2025-3-30 21:55
Kirsten M. A. Revell,Neville A. Stantonmonomials). For a given integer . ≥ 1 and a given real . >0, the algorithm queries . at . points. If . is a polynomial of degree at most ., the algorithm always accepts, and if the value of . has to be modified on at least an . fraction of all inputs in order to transform it to such a polynomial, th作者: 胡言亂語(yǔ) 時(shí)間: 2025-3-31 04:53
Jothee Sinnakkannu,Ananda Samudhram which is the computational analog of statistical min-entropy. We consider three possible definitions for this notion, and show equivalence and separation results for these definitions in various computational models..We also study whether or not certain properties of statistical min-entropy have a 作者: ventilate 時(shí)間: 2025-3-31 06:22
https://doi.org/10.1007/978-3-031-28390-1y testable code with minimal distance . over any finite field . cannot have more than . codewords. This result holds even for testers with two-sided error. For general (non-linear) codes we obtain the exact same bounds on the code size as a function of the minimal distance, but our bounds apply only作者: 追逐 時(shí)間: 2025-3-31 10:51 作者: 行業(yè) 時(shí)間: 2025-3-31 14:37 作者: 單挑 時(shí)間: 2025-3-31 18:17
Covering Graphs Using Trees and Starsight of the maximum weight tree in the tree cover. Given a positive integer ., the .-tree cover problem is to compute a minimum cost tree cover which has no more than . trees. Star covers are defined analogously. Additionally, we may also be provided with a set of . vertices which are to serve as ro作者: attenuate 時(shí)間: 2025-3-31 23:59
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minordes a .. minor, Klein, Plotkin and Rao [15] showed that this can be done while cutting only .(../.) fraction of the edges. This implies a bound on multicommodity max-flow min-cut ratio for such graphs. This result as well as the decomposition theorem have found numerous applications to approximation作者: 表示向前 時(shí)間: 2025-4-1 03:16
Approximation Algorithms for Channel Allocation Problems in Broadcast Networksthms. The problems considered have the property that the space occupied by a collection of objects together could be significantly less than the sum of the sizes of the individual objects. In the ., there are users who request subsets of items. There are a fixed number of channels that can carry an 作者: IDEAS 時(shí)間: 2025-4-1 06:41
Asymmetry in ,-Center Variantsm, similar to the .-median problem. Variants of .-center may more accurately model real-life problems than the original formulation. Asymmetry is a significant impediment to approximation in many graph problems, such as .-center, facility location, .-median and the TSP..We demonstrate an .(log..)-ap作者: blackout 時(shí)間: 2025-4-1 13:40
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Timesin minimal time. In the setting of flows over time, flow on arcs may vary over time and the transit time of an arc is the time it takes for flow to travel through this arc. In most real-world applications (such as, e.g., road traffic, communication networks, production systems, etc.), transit times 作者: OMIT 時(shí)間: 2025-4-1 15:48
On the Complexity of Approximating ,-Dimensional Matchingl matching in a k-partite k-uniform balanced hyper-graph. We prove that k-DM cannot be efficiently approximated to within a factor of . unless . = .. This improves the previous factor of . by Trevisan [Tre01]. For low . values we prove NP-hardness factors of . and . for 4-DM, 5-DM and 6-DM respectiv作者: farewell 時(shí)間: 2025-4-1 20:24 作者: BAIL 時(shí)間: 2025-4-2 01:08 作者: 節(jié)省 時(shí)間: 2025-4-2 03:52 作者: 刺穿 時(shí)間: 2025-4-2 08:02
Effective Routing and Scheduling in Adversarial Queueing Networkss in the setting of an arbitrary synchronous, . network. In an adversarial network, the nature of the incoming traffic is decided by an adversary, operating under a reasonable rate restriction. Such networks have attracted attention in recent years as they appear to be a convenient and useful way to作者: 支架 時(shí)間: 2025-4-2 12:22
Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placemenurther, each item is associated with a profit and a color, and items of the same color can . the use of one resource. We need to allocate the resources to the most profitable (feasible) subset of items. In alternative formulation, we need to . the most profitable subset of items in a set of 2-dimens作者: Overstate 時(shí)間: 2025-4-2 18:53 作者: SMART 時(shí)間: 2025-4-2 20:23
Testing Low-Degree Polynomials over ,(2)monomials). For a given integer . ≥ 1 and a given real . >0, the algorithm queries . at . points. If . is a polynomial of degree at most ., the algorithm always accepts, and if the value of . has to be modified on at least an . fraction of all inputs in order to transform it to such a polynomial, th
