標(biāo)題: Titlebook: Algorithms - ESA 2003; 11th Annual European Giuseppe Battista,Uri Zwick Conference proceedings 2003 Springer-Verlag Berlin Heidelberg 2003 [打印本頁(yè)] 作者: 軍械 時(shí)間: 2025-3-21 17:06
書(shū)目名稱(chēng)Algorithms - ESA 2003影響因子(影響力)
書(shū)目名稱(chēng)Algorithms - ESA 2003影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Algorithms - ESA 2003網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Algorithms - ESA 2003網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Algorithms - ESA 2003被引頻次
書(shū)目名稱(chēng)Algorithms - ESA 2003被引頻次學(xué)科排名
書(shū)目名稱(chēng)Algorithms - ESA 2003年度引用
書(shū)目名稱(chēng)Algorithms - ESA 2003年度引用學(xué)科排名
書(shū)目名稱(chēng)Algorithms - ESA 2003讀者反饋
書(shū)目名稱(chēng)Algorithms - ESA 2003讀者反饋學(xué)科排名
作者: 分期付款 時(shí)間: 2025-3-22 00:14
Betriebsablauf-orientiertes MUM,define a density parameter that, loosely speaking, bounds the number of zig-zags between locations within a time window. We present a dynamic programming algorithm that finds a tour that visits at least ./. locations during their time windows. This algorithm can be extended to deal with non-unit job作者: 聾子 時(shí)間: 2025-3-22 02:41 作者: hypertension 時(shí)間: 2025-3-22 07:39
Handbibliothek für Bauingenieureral measure, generalizing the union of data streams or counting distinct elements in data streams..We present the first known data stream algorithms for estimating max-dominance of multiple signals. In particular, we use workspace and time-per-item that are both sublinear (in fact, poly-logarithmic)作者: 做作 時(shí)間: 2025-3-22 12:22 作者: 先兆 時(shí)間: 2025-3-22 15:23
Line System Design and a Generalized Coloring Probleme problem. Here . is proportional to the number of color sets. For the circular graph problem we show that most versions of the problem are hard to approximate to any bounded ratio and we present a 2(1?+?.) approximation scheme for a special version of the problem.作者: TRUST 時(shí)間: 2025-3-22 17:28 作者: Horizon 時(shí)間: 2025-3-23 00:41
Semi-clairvoyant Schedulinglairvoyant on-line algorithms. In some sense one might conclude from this that the QoS achievable by semi-clairvoyant algorithms is competitive with clairvoyant algorithms..It is known that the clairvoyant algorithm SRPT is optimal with respect to average flow time and is 2-competitive with respect 作者: SMART 時(shí)間: 2025-3-23 04:00
Estimating Dominance Norms of Multiple Data Streamsral measure, generalizing the union of data streams or counting distinct elements in data streams..We present the first known data stream algorithms for estimating max-dominance of multiple signals. In particular, we use workspace and time-per-item that are both sublinear (in fact, poly-logarithmic)作者: Adjourn 時(shí)間: 2025-3-23 09:15 作者: innovation 時(shí)間: 2025-3-23 12:36 作者: MUT 時(shí)間: 2025-3-23 15:37 作者: Cultivate 時(shí)間: 2025-3-23 19:51 作者: Junction 時(shí)間: 2025-3-23 23:22 作者: 浸軟 時(shí)間: 2025-3-24 03:00 作者: 斥責(zé) 時(shí)間: 2025-3-24 08:10
,Einführung in den Eisenbetonbau,A kinetic dictionary is a data structure for storing a set . of continuously moving points on the real line, such that at any time we can quickly determine for a given query point . whether .?∈?.. We study trade-offs between the worst-case query time in a kinetic dictionary and the total cost of maintaining it during the motions of the points.作者: engrossed 時(shí)間: 2025-3-24 14:37
https://doi.org/10.1007/978-3-642-99917-8Two mobile agents having distinct identifiers and located in nodes of an unknown anonymous connected graph, have to meet at some node of the graph. We present fast . algorithms for this rendezvous problem.作者: Emasculate 時(shí)間: 2025-3-24 16:17 作者: inspired 時(shí)間: 2025-3-24 20:34 作者: aptitude 時(shí)間: 2025-3-25 01:12
Deterministic Rendezvous in GraphsTwo mobile agents having distinct identifiers and located in nodes of an unknown anonymous connected graph, have to meet at some node of the graph. We present fast . algorithms for this rendezvous problem.作者: collagenase 時(shí)間: 2025-3-25 05:50 作者: Indebted 時(shí)間: 2025-3-25 10:21 作者: pus840 時(shí)間: 2025-3-25 13:51
Algorithms - ESA 2003978-3-540-39658-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: intercede 時(shí)間: 2025-3-25 18:37
0302-9743 Overview: Includes supplementary material: 978-3-540-20064-2978-3-540-39658-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Semblance 時(shí)間: 2025-3-25 21:51
Aussetzung und Ruhen des Verfahrensnd provide a proof of the validity of the answer to the user. We present a survey of techniques for designing authenticated data structures and overview their computational efficiency. We also discuss implementation issues and practical applications.作者: 發(fā)酵 時(shí)間: 2025-3-26 02:49 作者: Delirium 時(shí)間: 2025-3-26 06:47 作者: 昏睡中 時(shí)間: 2025-3-26 10:50
Aussetzung und Ruhen des Verfahrensnd provide a proof of the validity of the answer to the user. We present a survey of techniques for designing authenticated data structures and overview their computational efficiency. We also discuss implementation issues and practical applications.作者: 有毒 時(shí)間: 2025-3-26 13:24 作者: 鼓掌 時(shí)間: 2025-3-26 19:16
Was tun, wenn alles zu sp?t ist?ven a set of . weighted points in ?., the range-max problem asks for the maximum-weight point in a query hyper-rectangle. In the dual stabbing-max problem, we are given . weighted hyper-rectangles, and we wish to find the maximum-weight rectangle containing a query point. Our structures improve on p作者: Tartar 時(shí)間: 2025-3-27 00:55 作者: 共和國(guó) 時(shí)間: 2025-3-27 02:33 作者: 元音 時(shí)間: 2025-3-27 09:09 作者: OFF 時(shí)間: 2025-3-27 12:38 作者: PALMY 時(shí)間: 2025-3-27 17:13 作者: 使虛弱 時(shí)間: 2025-3-27 21:11 作者: 爭(zhēng)吵加 時(shí)間: 2025-3-27 22:59
https://doi.org/10.1007/978-3-322-98693-1most .. minutes. A recent approach called harmonic broadcasting optimally solves the case of many viewers watching a movie using a constant amount of bandwidth. We consider the more general setting and . changes dynamically. A natural objective is to minimize the amount of resources required to achi作者: Inveterate 時(shí)間: 2025-3-28 05:31 作者: 變白 時(shí)間: 2025-3-28 09:24
https://doi.org/10.1007/978-3-642-92280-0ch as strong connectivity) The input consists of a . complete weighted graph .=(.,.). The . of a vertex . in a directed spanning subgraph . is given by .(.)?=?...(.). The . of . is given by ., Power Assignment seeks to minimize .(.) while . satisfies the given connectivity constraint. We present asy作者: 不規(guī)則的跳動(dòng) 時(shí)間: 2025-3-28 10:56
https://doi.org/10.1007/978-3-642-92280-0f . number pairs (..,..) with ..?>?0. Let .(.,.) of . be the consecutive subsequence of . starting index . to index .. The . of .(.,.) is .(.,.)?=?(..?+?..?+?...?+?..)/(..?+?..?+?...?+?..). The . is to find a maximum-density segment over all segments of . with .?≤?..?+?..?+?...?+?..?≤?.. The best pr作者: folliculitis 時(shí)間: 2025-3-28 17:09
Handbibliothek für Bauingenieuremultiple signals. Formally, a stream of multiple signals is (.,..) where .’s correspond to the domain, .’s index the different signals and ..?≥?0 give the value of the .th signal at point .. We study the problem of finding norms that are cumulative of the multiple signals in the data stream..For exa作者: COLON 時(shí)間: 2025-3-28 18:48 作者: 易于交談 時(shí)間: 2025-3-29 01:27 作者: sigmoid-colon 時(shí)間: 2025-3-29 06:21
Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Propertieshe .-median problem, but our approach does not yield a polynomial time algorithm with this guarantee. We also give a new simple proof of the performance guarantee of the Mettu-Plaxton algorithm using LP duality, which suggests a minor modification of the algorithm that makes it Lagrangian-multiplier preserving.作者: LINES 時(shí)間: 2025-3-29 10:57
Scheduling for Flow-Time with Admission Controle also give a resource augmentation result for the case of arbitrary penalties achieving a competitive ratio of . using a (1 + .) speed processor. Finally, we present a number of lower bounds for both the case of uniform and arbitrary penalties.作者: Vo2-Max 時(shí)間: 2025-3-29 14:19 作者: 減至最低 時(shí)間: 2025-3-29 18:58 作者: chlorosis 時(shí)間: 2025-3-29 21:02 作者: Esophagus 時(shí)間: 2025-3-30 00:44 作者: hallow 時(shí)間: 2025-3-30 04:32
https://doi.org/10.1007/978-3-642-92280-0mptotically optimal .(log .)-approximation algorithms for three Power Assignment problems: Min-Power Strong Connectivity, Min-Power Symmetric Connectivity (the undirected graph having an edge . iff . has both . and . must be connected) and Min-Power Broadcast (the input also has .?∈?. , and . must be a .-rooted outgoing spanning arborescence).作者: LANCE 時(shí)間: 2025-3-30 12:02
https://doi.org/10.1007/978-3-663-16160-8g that 2.-connected bipartite graphs are .-tight. We give a new algorithm for finding a maximal .-sharp subgraph. We also answer a question of Imai and show that finding a maximum size .-sharp subgraph is NP-hard.作者: 手榴彈 時(shí)間: 2025-3-30 15:11 作者: 肉體 時(shí)間: 2025-3-30 18:07 作者: 忍受 時(shí)間: 2025-3-30 21:05 作者: Adenocarcinoma 時(shí)間: 2025-3-31 02:50
Optimal Dynamic Video-on-Demand Using Adaptive Broadcastingnd propose strategies which are optimal for each of them. In particular, we show that an adaptive form of pyramid broadcasting is optimal for both measures simultaneously, up to constant factors. We also show that the maximum throughput for a fixed network bandwidth cannot be obtained by any online strategy.作者: chronology 時(shí)間: 2025-3-31 05:11 作者: 正常 時(shí)間: 2025-3-31 12:18
Entscheidung über den Einspruchraction of the input data is essentially unnecessary. While grounding the discussion on a few specific examples, I will review some of the basic principles at play behind this “sublinearity” phenomenon.作者: Antioxidant 時(shí)間: 2025-3-31 17:06 作者: GUISE 時(shí)間: 2025-3-31 20:24 作者: 搖曳的微光 時(shí)間: 2025-4-1 00:56
An Optimal Algorithm for the Maximum-Density Segment Problemhe input sequence in an online manner, which is an important feature for dealing with genome-scale sequences. Moreover, for an input sequence . representable in .(.) space, we also show how to exploit the sparsity of . and solve the maximum-density segment problem for . in .(.) time.作者: 你敢命令 時(shí)間: 2025-4-1 02:12
Sublinear Computingt results in property testing, streaming, and sublinear approximation algorithms have shown that, for a large class of problems, all but a vanishing fraction of the input data is essentially unnecessary. While grounding the discussion on a few specific examples, I will review some of the basic princ作者: 拾落穗 時(shí)間: 2025-4-1 08:24 作者: LURE 時(shí)間: 2025-4-1 13:20 作者: gratify 時(shí)間: 2025-4-1 16:32
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queriesven a set of . weighted points in ?., the range-max problem asks for the maximum-weight point in a query hyper-rectangle. In the dual stabbing-max problem, we are given . weighted hyper-rectangles, and we wish to find the maximum-weight rectangle containing a query point. Our structures improve on p作者: Lumbar-Stenosis 時(shí)間: 2025-4-1 20:18
Line System Design and a Generalized Coloring Problemlem we are interested in finding a coloring and routing of “demands” of minimum total cost where the total cost is obtained by accumulating the cost incurred at certain “l(fā)inks” in the graph. The colors are partitioned in sets and the sets themselves are ordered so that colors in higher sets cost mor
