標(biāo)題: Titlebook: Approximation and Online Algorithms; 8th International Wo Klaus Jansen,Roberto Solis-Oba Conference proceedings 2011 Springer Berlin Heidel [打印本頁(yè)] 作者: onychomycosis 時(shí)間: 2025-3-21 18:20
書(shū)目名稱Approximation and Online Algorithms影響因子(影響力)
書(shū)目名稱Approximation and Online Algorithms影響因子(影響力)學(xué)科排名
書(shū)目名稱Approximation and Online Algorithms網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Approximation and Online Algorithms網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Approximation and Online Algorithms被引頻次
書(shū)目名稱Approximation and Online Algorithms被引頻次學(xué)科排名
書(shū)目名稱Approximation and Online Algorithms年度引用
書(shū)目名稱Approximation and Online Algorithms年度引用學(xué)科排名
書(shū)目名稱Approximation and Online Algorithms讀者反饋
書(shū)目名稱Approximation and Online Algorithms讀者反饋學(xué)科排名
作者: 忙碌 時(shí)間: 2025-3-21 23:24
Approximating Directed Buy-at-Bulk Network Designal study of the same problem on directed graphs, thus capturing real-life situations where the cost of installing capacity on an edge is asymmetric with respect to direction, as e.g. in the design of wireless and satellite communication networks..More specifically, we develop two approximation algor作者: DAMN 時(shí)間: 2025-3-22 04:19 作者: Agility 時(shí)間: 2025-3-22 05:00 作者: conifer 時(shí)間: 2025-3-22 11:37 作者: 有毛就脫毛 時(shí)間: 2025-3-22 13:18
Tradeoff between Energy and Throughput for Online Deadline Scheduling assume each job is associated with a user-defined value (or importance) and a deadline. We allow scheduling algorithms to discard some of the jobs (i.e., not finishing them) and the objective is to minimize the total energy usage plus the total value of jobs discarded. We give new online algorithms作者: 紳士 時(shí)間: 2025-3-22 17:22
New Models and Algorithms for Throughput Maximization in Broadcast Schedulingata. Clients issue requests for data from resources and the data may be dynamic or changing which imposes temporal constraints on the delivery of the data. A proxy server has to compute a probing schedule for the resources since it can probe a limited number of resources at each time step. Due to ov作者: Atmosphere 時(shí)間: 2025-3-22 22:25
Densest ,-Subgraph Approximation on Intersection Graphslimination orders, introduced by Akcoglu et al. [1], generalizing the perfect elimination orders for chordal graphs, and develop a simple .(.)-approximation technique for graphs admitting such a vertex order. This concept allows us to derive constant factor approximation algorithms for .-. on many i作者: anarchist 時(shí)間: 2025-3-23 04:12
The Train Delivery Problem - Vehicle Routing Meets Bin Packingroblem with unsplittable demands. The problem is also equivalent to the problem of minimizing the makespan on a single batch machine with non-identical job sizes..The train delivery problem is strongly NP-hard and does not admit an approximation ratio better than 3/2. We design the first approximati作者: DIKE 時(shí)間: 2025-3-23 08:00
An FPTAS for Flows over Time with Aggregate Arc Capacitiescifies for each arc a time-dependent flow rate that must always be bounded by the arc’s capacity. Only recently, Melkonian introduced an alternative model where so-called . bound the total amount of flow traveling along an arc, at any point of time..The contribution of this paper is twofold. Firstly作者: 松軟 時(shí)間: 2025-3-23 12:04
List Factoring and Relative Worst Order Analysisrved behavior of online algorithms for a range of different online problems. The contribution of this paper is twofold. First, it adds the static list accessing problem to the collection of online problems where relative worst order analysis gives better results. Second, and maybe more interesting, 作者: 敵手 時(shí)間: 2025-3-23 15:23
Approximation Algorithms for Domination Searchdth and hypertree width. The task is to identify the minimum number of cops sufficient to catch the visible and fast robber. In .-domination search, the robber is being arrested if he resides inside a ball of radius . around some cop. In this setting, the power of the cops does not depend only on ho作者: 沒(méi)收 時(shí)間: 2025-3-23 20:13 作者: 考得 時(shí)間: 2025-3-23 23:30 作者: 狂熱語(yǔ)言 時(shí)間: 2025-3-24 05:53
A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Taskarbitrary parameter .?∈?? it yields solutions with at most . many processors, thus it gives an asymptotic 3/2-approximation algorithm. This improves over the previously best known ratio of 7/4. Our algorithm can be implemented to run in time .(..), where . is the number of tasks. It is based on cust作者: 不可知論 時(shí)間: 2025-3-24 10:14
Online Tracking of the Dominance Relationship of Distributed Multi-dimensional Dataip of some distributed multi-dimensional data. Such data keep changing from time to time. The objective is to minimize the communication between the root and the distributed data sources. Assume that data are chosen from the .-dimensional grid {1, 2,???, .}., we give an .(. log.)-competitive algorit作者: Parley 時(shí)間: 2025-3-24 13:36
How to Play Unique Games on Expanders??.)-satisfiable instance of Unique Games with the constraint graph ., our algorithm finds an assignment satisfying at least a 1???../.. fraction of all constraints if .?
作者: 帶子 時(shí)間: 2025-3-24 18:01 作者: 制造 時(shí)間: 2025-3-24 21:07
Conference proceedings 2011A 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event..The 23 revised full papers presented were carefully reviewed and.selected from 58 submissions. The workshop covered areas such as.algorithmic game theory, approximation classes, coloring and.partitioning, com作者: 極小量 時(shí)間: 2025-3-25 02:05
0302-9743 ings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event..The 23 revised full papers presented were carefully reviewed and.selected from 58 submissions. The workshop covered areas such作者: 譏諷 時(shí)間: 2025-3-25 06:09 作者: AXIS 時(shí)間: 2025-3-25 10:45 作者: flimsy 時(shí)間: 2025-3-25 13:49
Vererbungsforschung und innere Medizin,ver the previously best known ratio of 7/4. Our algorithm can be implemented to run in time .(..), where . is the number of tasks. It is based on custom-tailored weights for the tasks such that a greedy maximal matching and subsequent partitioning by a first-fit strategy yields the result.作者: miscreant 時(shí)間: 2025-3-25 17:16 作者: 笨拙處理 時(shí)間: 2025-3-25 20:41 作者: Entirety 時(shí)間: 2025-3-26 00:29
List Factoring and Relative Worst Order Analysis accessing problem to the collection of online problems where relative worst order analysis gives better results. Second, and maybe more interesting, it adds the non-trivial supplementary proof technique of list factoring to the theoretical toolbox for relative worst order analysis.作者: maroon 時(shí)間: 2025-3-26 06:01 作者: 扔掉掐死你 時(shí)間: 2025-3-26 12:17 作者: 直覺(jué)好 時(shí)間: 2025-3-26 15:53
A. Czerny,F. Kraus,A. Schittenhelmal) graph classes that are closed under taking of minors. We give a constant factor approximation algorithm that for every fixed . and graph ., computes the minimum number of cops required to capture the robber in the .-domination game on graphs excluding . as a minor.作者: 慢跑鞋 時(shí)間: 2025-3-26 19:33 作者: 逗留 時(shí)間: 2025-3-26 21:47 作者: 夾死提手勢(shì) 時(shí)間: 2025-3-27 01:34
Approximation Algorithms for Domination Searchal) graph classes that are closed under taking of minors. We give a constant factor approximation algorithm that for every fixed . and graph ., computes the minimum number of cops required to capture the robber in the .-domination game on graphs excluding . as a minor.作者: 延期 時(shí)間: 2025-3-27 08:02
Approximating Survivable Networks with Minimum Number of Steiner Pointsance (.?=?(.,.),.,.), such that an .-approximation for the . instance implies an .·.(..)-approximation algorithm for the . instance. In particular, for the most interesting case of uniform requirement .(.,.)?=?. for all .,.?∈?., we obtain for . the ratio .(.. ln .), which solves an open problem from [3].作者: 周興旺 時(shí)間: 2025-3-27 11:28 作者: 松軟無(wú)力 時(shí)間: 2025-3-27 15:14 作者: 淡紫色花 時(shí)間: 2025-3-27 21:27 作者: Sigmoidoscopy 時(shí)間: 2025-3-28 00:57 作者: entitle 時(shí)間: 2025-3-28 05:49
Conference proceedings 2011petitive analysis, computational finance, cuts and.connectivity, geometric problems, inapproximability results, echanism.design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized.complexity, randomization techniques, real-world applications, and.scheduling problems..作者: aphasia 時(shí)間: 2025-3-28 07:10 作者: floodgate 時(shí)間: 2025-3-28 12:59
The Physiology of growth Hormone,ntersection graph classes, such as chordal graphs, circular-arc graphs, claw-free graphs, line graphs of ?-hypergraphs, disk graphs, and the intersection graphs of fat geometric objects. We also present a PTAS for .-. on unit disk graphs using the shifting technique.作者: 接觸 時(shí)間: 2025-3-28 18:29
,über die alveol?re Lungenproteinose,, we introduce a common generalization of both the classical flow over time model and Melkonian’s model. Secondly, we present a non-trivial extension of an FPTAS by Fleischer and Skutella to our new flow model. Prior to this, no approximation algorithm was known for Melkonian’s model.作者: GONG 時(shí)間: 2025-3-28 21:36
The Physiology of growth Hormone,died broadcast scheduling problems. However, the specific requirements of the applications motivate some generalizations and variants of previously studied metrics for broadcast scheduling. We consider both online and offline versions of these problems and provide new algorithms and results.作者: Fibrin 時(shí)間: 2025-3-28 23:39 作者: 演繹 時(shí)間: 2025-3-29 06:10
Die rheumatische Infektion im Kindesalter,SPT, is not better than 1.243. This constitutes the first lower bound for WSEPT in this setting, and in particular, it sheds new light on the fundamental differences between deterministic and stochastic scheduling problems.作者: octogenarian 時(shí)間: 2025-3-29 10:38
New Models and Algorithms for Throughput Maximization in Broadcast Schedulingdied broadcast scheduling problems. However, the specific requirements of the applications motivate some generalizations and variants of previously studied metrics for broadcast scheduling. We consider both online and offline versions of these problems and provide new algorithms and results.作者: Foreknowledge 時(shí)間: 2025-3-29 14:28 作者: perjury 時(shí)間: 2025-3-29 17:27
Lower Bounds for Smith’s Rule in Stochastic Machine SchedulingSPT, is not better than 1.243. This constitutes the first lower bound for WSEPT in this setting, and in particular, it sheds new light on the fundamental differences between deterministic and stochastic scheduling problems.作者: Apraxia 時(shí)間: 2025-3-29 21:08
How to Play Unique Games on Expanders??.)-satisfiable instance of Unique Games with the constraint graph ., our algorithm finds an assignment satisfying at least a 1???../.. fraction of all constraints if .?
作者: 輪流 時(shí)間: 2025-3-30 00:43
A. Czerny,F. Kraus,A. SchittenhelmWe study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximization and the minimization versions of the problem on tournaments (max acyclic subgraph, feedback arc set). We also study the case when the items arrive in random order.作者: 接觸 時(shí)間: 2025-3-30 07:34
Online Ranking for Tournament GraphsWe study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximization and the minimization versions of the problem on tournaments (max acyclic subgraph, feedback arc set). We also study the case when the items arrive in random order.作者: 解凍 時(shí)間: 2025-3-30 10:03
Klaus Jansen,Roberto Solis-ObaHigh quality selected papers.Unique visibility.State of the art research作者: 考得 時(shí)間: 2025-3-30 14:11 作者: 最小 時(shí)間: 2025-3-30 19:15 作者: 多節(jié) 時(shí)間: 2025-3-30 21:08
A. Czerny,F. Kraus,A. Schittenhelmal study of the same problem on directed graphs, thus capturing real-life situations where the cost of installing capacity on an edge is asymmetric with respect to direction, as e.g. in the design of wireless and satellite communication networks..More specifically, we develop two approximation algor作者: colony 時(shí)間: 2025-3-31 03:41
A. Czerny,F. Kraus,A. Schittenhelmensional bin packing algorithms, and we give lower bounds for their asymptotic worst-case behaviour. For on-line algorithms so far the best lower bound was given by van Vliet in 1992 [13]. He proved that there is no on-line bin packing algorithm with better asymptotic performance ratio than 1.54014.作者: Obligatory 時(shí)間: 2025-3-31 06:58
https://doi.org/10.1007/978-3-642-90650-3an incomplete problem A which is neither in P nor NP-complete. Here we show that if RP≠NP, then there is a counting problem .. which neither has a . (FPRAS), nor is as hard to approximate as #SAT..This work is motivated by recent results showing that approximately counting .-colouring problems appea作者: 不要不誠(chéng)實(shí) 時(shí)間: 2025-3-31 11:17 作者: Melanocytes 時(shí)間: 2025-3-31 16:56
Zum Problem der Fettleibigkeit, assume each job is associated with a user-defined value (or importance) and a deadline. We allow scheduling algorithms to discard some of the jobs (i.e., not finishing them) and the objective is to minimize the total energy usage plus the total value of jobs discarded. We give new online algorithms作者: 書(shū)法 時(shí)間: 2025-3-31 18:41
The Physiology of growth Hormone,ata. Clients issue requests for data from resources and the data may be dynamic or changing which imposes temporal constraints on the delivery of the data. A proxy server has to compute a probing schedule for the resources since it can probe a limited number of resources at each time step. Due to ov作者: incision 時(shí)間: 2025-4-1 00:40 作者: Assignment 時(shí)間: 2025-4-1 04:12
,über die alveol?re Lungenproteinose,roblem with unsplittable demands. The problem is also equivalent to the problem of minimizing the makespan on a single batch machine with non-identical job sizes..The train delivery problem is strongly NP-hard and does not admit an approximation ratio better than 3/2. We design the first approximati作者: Tailor 時(shí)間: 2025-4-1 08:50 作者: 性冷淡 時(shí)間: 2025-4-1 14:14
L. Heilmeyer,R. Schoen,A. Praderrved behavior of online algorithms for a range of different online problems. The contribution of this paper is twofold. First, it adds the static list accessing problem to the collection of online problems where relative worst order analysis gives better results. Second, and maybe more interesting, 作者: 空洞 時(shí)間: 2025-4-1 14:48
A. Czerny,F. Kraus,A. Schittenhelmdth and hypertree width. The task is to identify the minimum number of cops sufficient to catch the visible and fast robber. In .-domination search, the robber is being arrested if he resides inside a ball of radius . around some cop. In this setting, the power of the cops does not depend only on ho作者: 親密 時(shí)間: 2025-4-1 19:10 作者: 暴行 時(shí)間: 2025-4-1 22:43 作者: Nuance 時(shí)間: 2025-4-2 05:16
Vererbungsforschung und innere Medizin,arbitrary parameter .?∈?? it yields solutions with at most . many processors, thus it gives an asymptotic 3/2-approximation algorithm. This improves over the previously best known ratio of 7/4. Our algorithm can be implemented to run in time .(..), where . is the number of tasks. It is based on cust作者: 正式通知 時(shí)間: 2025-4-2 10:00
Vererbungsforschung und innere Medizin,ip of some distributed multi-dimensional data. Such data keep changing from time to time. The objective is to minimize the communication between the root and the distributed data sources. Assume that data are chosen from the .-dimensional grid {1, 2,???, .}., we give an .(. log.)-competitive algorit作者: Counteract 時(shí)間: 2025-4-2 13:06
,Idiopathische ?deme im S?uglingsalter,??.)-satisfiable instance of Unique Games with the constraint graph ., our algorithm finds an assignment satisfying at least a 1???../.. fraction of all constraints if .?
