標(biāo)題: Titlebook: Algorithm Theory - SWAT 2000; 7th Scandinavian Wor Magnus M. Halldorsson Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 [打印本頁(yè)] 作者: retort 時(shí)間: 2025-3-21 18:32
書(shū)目名稱(chēng)Algorithm Theory - SWAT 2000影響因子(影響力)
書(shū)目名稱(chēng)Algorithm Theory - SWAT 2000影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Algorithm Theory - SWAT 2000網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Algorithm Theory - SWAT 2000網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Algorithm Theory - SWAT 2000被引頻次
書(shū)目名稱(chēng)Algorithm Theory - SWAT 2000被引頻次學(xué)科排名
書(shū)目名稱(chēng)Algorithm Theory - SWAT 2000年度引用
書(shū)目名稱(chēng)Algorithm Theory - SWAT 2000年度引用學(xué)科排名
書(shū)目名稱(chēng)Algorithm Theory - SWAT 2000讀者反饋
書(shū)目名稱(chēng)Algorithm Theory - SWAT 2000讀者反饋學(xué)科排名
作者: cringe 時(shí)間: 2025-3-21 23:55 作者: PHONE 時(shí)間: 2025-3-22 01:35
On-Line Scheduling with Precedence Constraintsgive a (randomized) lower bound of Ω(logm) with or without preemptions. We show that the (deterministic) greedy algorithm (no preemptions used), is . for this model i.e. O(logm) competitive. However, for general precedence constraints, we show a lower bound of . which is easily matched by a greedy a作者: 細(xì)頸瓶 時(shí)間: 2025-3-22 05:55
Improved Upper Bounds for Pairing Heapsge sorted lists of varying sized optimally, within constant factors. Utilizing the distribution sensitive behavior of pairing heap, an alternative method the employs pairing heaps for optimal list merging is derived.作者: 不容置疑 時(shí)間: 2025-3-22 10:47
On Graph Powers for Leaf-Labeled Treeseaf power of a tree T, and if so, produce a tree . for which G is a k-leaf power. We believe that our structural results will form the basis of a solution for more general k. The general problem of inferring hidden tree structure on the basis of leaf relationships shows up in several areas of application.作者: regale 時(shí)間: 2025-3-22 16:15 作者: Creditee 時(shí)間: 2025-3-22 19:02
https://doi.org/10.1007/978-3-322-93517-5ecisely, the size of the separator is within an ..) factor of the optimal for the class of planar graphs, where δ is any positive constant, and can be listed in time proportional to its size. The dynamic data structure occupies . space and can initially be constructed in time linear to the size of the original graph.作者: incite 時(shí)間: 2025-3-23 00:21 作者: 指耕作 時(shí)間: 2025-3-23 03:45
Diskurs 4: Integrierende Demokratiepetitive ratio of 1 + 1/e.. We show that the algorithm is optimal by proving a matching lower bound..We also consider the non-preemptive model with temporary tasks. We prove that for .=. + 1, the greedy algorithm is optimal. (It is not optimal for permanent tasks).作者: abreast 時(shí)間: 2025-3-23 07:01
A Dynamic Algorithm for Maintaining Graph Partitionsecisely, the size of the separator is within an ..) factor of the optimal for the class of planar graphs, where δ is any positive constant, and can be listed in time proportional to its size. The dynamic data structure occupies . space and can initially be constructed in time linear to the size of the original graph.作者: 純樸 時(shí)間: 2025-3-23 12:06
Data Structures for Maintaining Set Partitionsefined partition {VW Beetle, Toyota}, {Lexus}, {Cadillac}, whereas the union of all three features completely distinguishes the types of cars. In fact, . and . are sufficient for complete identification, so . could be deleted from the set of features without affecting the induced partition.作者: SAGE 時(shí)間: 2025-3-23 17:38
Resource Augmentation in Load Balancingpetitive ratio of 1 + 1/e.. We show that the algorithm is optimal by proving a matching lower bound..We also consider the non-preemptive model with temporary tasks. We prove that for .=. + 1, the greedy algorithm is optimal. (It is not optimal for permanent tasks).作者: 富饒 時(shí)間: 2025-3-23 18:07
Diskurs 4: Integrierende Demokratie an adversary with an unbounded cache if Landlord has a cache large enough to store the Ω(log n) largest pages. This is further theoretical evidence that Landlord is the “ght” algorithm for web caching.作者: GLOSS 時(shí)間: 2025-3-23 22:44 作者: Bravura 時(shí)間: 2025-3-24 04:50 作者: 友好 時(shí)間: 2025-3-24 08:43 作者: Nibble 時(shí)間: 2025-3-24 13:44 作者: Fabric 時(shí)間: 2025-3-24 18:20 作者: 慌張 時(shí)間: 2025-3-24 19:24
Frauen und Demokratie in Schleswig-Holstein performing admission control on the items, we get better performance for various measures compared with the performance achieved on the fair version of the problem. Our main result shows that we can pack 2/3 of the items for sequences in which the optimal can pack all the items.作者: Oration 時(shí)間: 2025-3-25 00:54
Florian Weber-Stein,Joachim Engelata is an exceptionally attractive and — noting its role in the heart of life — challenging application domain for combinatorial algorithmics. Hence it does not come as a surprise that computational molecular biology and bioinformatics are currently very active interdiciplinary research areas [.,.].作者: 紳士 時(shí)間: 2025-3-25 04:15
Wolfgang Merkel,Alexander Petringvarious queries about the convex hull in optimal O(log .) worst-case time. The data structure requires .) space. Applications of the new dynamic convex hull data structure are improved deterministic algorithms for the k-level problem and the red-blue segment intersection problem where all red and all blue segments are connected.作者: creditor 時(shí)間: 2025-3-25 10:33 作者: 蚊帳 時(shí)間: 2025-3-25 11:58 作者: excrete 時(shí)間: 2025-3-25 16:26
Toward Complete Genome Data Mining in Computational Biologyata is an exceptionally attractive and — noting its role in the heart of life — challenging application domain for combinatorial algorithmics. Hence it does not come as a surprise that computational molecular biology and bioinformatics are currently very active interdiciplinary research areas [.,.].作者: 精致 時(shí)間: 2025-3-25 20:54 作者: Granular 時(shí)間: 2025-3-26 02:02
Fixed Parameter Algorithms for P, D, S, and Related Problemsn can be found in . time. The same technique can be used to show that the disk dimension problem (find a minimum set of faces that cover all vertices of a given plane graph) can be solved in . time for .. Similar results can be obtained for some variants of {updominating set}, e.g., ..作者: BACLE 時(shí)間: 2025-3-26 06:24
Embeddings of k-Connected Graphs of Pathwidth kpological embedding of graphs from subclasses of partial k-trees. Of independent interest are structural properties of k-connected graphs of bounded pathwidth on which our algorithms are based. We also describe special cases which reduce to various generalizations of string matching, permitting more efficient solutions.作者: 誰(shuí)在削木頭 時(shí)間: 2025-3-26 10:37
https://doi.org/10.1007/3-540-44985-XApproximation; Complexity; Computational Discrete Mathematics; Graph Computations; Matchings; Network Alg作者: Ingenuity 時(shí)間: 2025-3-26 16:40 作者: innovation 時(shí)間: 2025-3-26 17:51 作者: Onerous 時(shí)間: 2025-3-26 22:21
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152831.jpg作者: 束以馬具 時(shí)間: 2025-3-27 02:35 作者: 沉思的魚(yú) 時(shí)間: 2025-3-27 06:01 作者: legislate 時(shí)間: 2025-3-27 10:29 作者: ENDOW 時(shí)間: 2025-3-27 14:05
https://doi.org/10.1007/978-3-322-98568-2rministic dictionary with membership queries in time (log log n). and updates in time (log n)., where . is the size of the set stored. This is the first such data structure to simultaneously achieve query time .. and update time ...)) for a constant c<1.作者: meretricious 時(shí)間: 2025-3-27 21:41
https://doi.org/10.1007/978-3-658-00702-7erization of weakly triangulated graphs, as well as a new recognition algorithm which, unlike the previous ones, is not based on the notion of 2-pair, but rather on the structural properties of the minimal separators of the graph. It also gives the strongest relationship to the class of triangulated graphs that has been established so far.作者: BOLT 時(shí)間: 2025-3-27 22:28 作者: 低三下四之人 時(shí)間: 2025-3-28 04:36 作者: musicologist 時(shí)間: 2025-3-28 09:28
https://doi.org/10.1007/978-3-322-98568-2rministic dictionary with membership queries in time (log log n). and updates in time (log n)., where . is the size of the set stored. This is the first such data structure to simultaneously achieve query time .. and update time ...)) for a constant c<1.作者: Seizure 時(shí)間: 2025-3-28 13:37 作者: Complement 時(shí)間: 2025-3-28 17:16 作者: shrill 時(shí)間: 2025-3-28 20:03
https://doi.org/10.1007/978-3-322-93517-5ial equations on a shared memory multiprocessor. We consider planar graphs of bounded face sizes that can be modified by local insertions or deletions of vertices or edges so that planarity is preserved. In our paper we describe a data structure that can be updated in O(log .) time after any such mo作者: Petechiae 時(shí)間: 2025-3-28 22:54
https://doi.org/10.1007/978-3-322-93517-5 may result in merging previously distinguished classes. As an illustration, consider the set of automobile types {VW Beetle, Toyota, Lexus, Cadillac}. The feature . partitions the cars into sets of small and large cars, {VW Beetle, Toyota}, {Lexus, Cadillac}. The feature . partitions the cars into 作者: outrage 時(shí)間: 2025-3-29 03:28
https://doi.org/10.1007/978-3-322-93517-5nput graph and .. To obtain this result, we show that the treewidth of a planar graph with domination number k is ., and that such a tree decomposition can be found in . time. The same technique can be used to show that the disk dimension problem (find a minimum set of faces that cover all vertices 作者: 切割 時(shí)間: 2025-3-29 08:09 作者: Opponent 時(shí)間: 2025-3-29 14:43 作者: Congeal 時(shí)間: 2025-3-29 16:53 作者: Irritate 時(shí)間: 2025-3-29 23:02
Diskurs 4: Integrierende Demokratieis proportional to its size, we show that the online algorithm LRU is (1 + 1/∈)-competitive against an adversary with . cache as long as LRU has a cache of size at least (1 + ∈) times the size of the largest item in the input sequence. In the general model, where pages have arbitrary access times an作者: Rejuvenate 時(shí)間: 2025-3-30 03:24
Diskurs 4: Integrierende Demokratieated machines and the model of restricted assignment. For the related machines model, we show a lower bound of Ω. for deterministic and randomized on-line algorithms, with or without preemptions even for jobs of known durations. This matches the deterministic upper bound of . given by Jaffe for task作者: ALB 時(shí)間: 2025-3-30 07:28
Theorie und Praxis der Diskursforschungllowing . arises: given a set of jobs of known processing time, schedule them on . machines so as to maximize the total weight of jobs completed before an initially unknown deadline. We will present optimally competitive deterministic and randomized algorithms for shut-down scheduling. Our determini作者: Incise 時(shí)間: 2025-3-30 08:23 作者: 放氣 時(shí)間: 2025-3-30 14:19 作者: 裝飾 時(shí)間: 2025-3-30 17:45
Demokratie im postkommunistischen EU-RaumWe show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All updates are supported in O(log n) time, where . is the size of the tree(s) involved in the update.作者: 上坡 時(shí)間: 2025-3-31 00:34 作者: Abrupt 時(shí)間: 2025-3-31 03:03
Maintaining Center and Median in Dynamic TreesWe show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All updates are supported in O(log n) time, where . is the size of the tree(s) involved in the update.作者: 收集 時(shí)間: 2025-3-31 07:41
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free GraphsIn this paper we consider the following problem. Given is a d-claw free graph G = (V,E,w) where w: V → R.. Our algorithm finds an independent set A such that w(A*)/w(A)≤ d/2 where A* is an independent that maximizes w(A*). The previous best polynomial time approximation algorithm obtained w(A*)/w(A)≤ 2d/3.作者: CAB 時(shí)間: 2025-3-31 10:19
Dynamic Graph Algorithms with Applicationsgeneral edge connectivity within a factor .. Finally, on the more practical side, we will discuss how output sensitive algorithms for dynamic shortest paths have been applied successfully to speed up local search algorithms for improving routing on the internet, roughly doubling the capacity.作者: 低能兒 時(shí)間: 2025-3-31 16:31 作者: Misgiving 時(shí)間: 2025-3-31 17:45
Recognizing Weakly Triangulated Graphs by Edge Separabilityerization of weakly triangulated graphs, as well as a new recognition algorithm which, unlike the previous ones, is not based on the notion of 2-pair, but rather on the structural properties of the minimal separators of the graph. It also gives the strongest relationship to the class of triangulated graphs that has been established so far.作者: 值得贊賞 時(shí)間: 2025-4-1 00:21 作者: Abrade 時(shí)間: 2025-4-1 01:51 作者: 管理員 時(shí)間: 2025-4-1 06:59
