標(biāo)題: Titlebook: Algorithms and Computation; 17th International S Tetsuo Asano Conference proceedings 2006 Springer-Verlag Berlin Heidelberg 2006 AAC.Schedu [打印本頁] 作者: Callow 時間: 2025-3-21 16:45
書目名稱Algorithms and Computation影響因子(影響力)
書目名稱Algorithms and Computation影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Computation被引頻次
書目名稱Algorithms and Computation被引頻次學(xué)科排名
書目名稱Algorithms and Computation年度引用
書目名稱Algorithms and Computation年度引用學(xué)科排名
書目名稱Algorithms and Computation讀者反饋
書目名稱Algorithms and Computation讀者反饋學(xué)科排名
作者: 他很靈活 時間: 2025-3-21 20:22
https://doi.org/10.1007/978-3-642-74101-2lems: . and some variations, counting the number of maximum weighted independent sets. We also briefly discuss how similar techniques can be used to design parameterized algorithms. As an example, we give fastest known algorithm solving .-. problem.作者: 空氣傳播 時間: 2025-3-22 03:35
Johannes Willms,Johann Weichbrodtdegree of any vertex or the number of edges in either the input graph or its complement. We further provide multiple types of recursive, deterministic algorithms for trees and forests, and provide an improvement for forests that makes use of randomization.作者: 滲透 時間: 2025-3-22 07:59 作者: Graves’-disease 時間: 2025-3-22 09:00 作者: medium 時間: 2025-3-22 15:24
https://doi.org/10.1007/978-3-642-84612-0ting targets. This is a significant improvement on . ≤.(. + 2) given by Fomin et.al. [2004] on graphs with small .-octopus... Dominating target, .-octopus, Dominating set, Dominating-pair graph, Steiner tree.作者: 傳染 時間: 2025-3-22 20:23
Die Dynamik der ProduktionsfunktionOn a line metric with . uniformly spaced points, our algorithm yields the first . and runs in quasi-polynomial time .(......) where . is the total number of requests. Our approach is based on a dynamic program that keeps track of the number of pending requests in each of .(log.) line segments that are geometrically increasing in length.作者: addict 時間: 2025-3-22 21:34 作者: 杠桿 時間: 2025-3-23 01:36
Offline Sorting Buffers on LineOn a line metric with . uniformly spaced points, our algorithm yields the first . and runs in quasi-polynomial time .(......) where . is the total number of requests. Our approach is based on a dynamic program that keeps track of the number of pending requests in each of .(log.) line segments that are geometrically increasing in length.作者: catagen 時間: 2025-3-23 06:31 作者: Awning 時間: 2025-3-23 10:08 作者: 座右銘 時間: 2025-3-23 15:11 作者: 濕潤 時間: 2025-3-23 19:16 作者: stress-response 時間: 2025-3-24 01:25
A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Recothat every tree .. in . is an . of .. It generalizes the smallest superstring problem and it has applications in glycobiology. We present a polynomial-time greedy algorithm with approximation ratio 6.作者: 調(diào)整校對 時間: 2025-3-24 04:08
Improved Approximation for Single-Sink Buy-at-Bulkat the flow from each source to the sink can be routed simultaneously. The approximation ratio of this NP-hard problem was gradually reduced from .(log..) to 65.49 by a long series of papers. In this paper, we design a better 24.92 approximation algorithm for this problem.作者: 影響帶來 時間: 2025-3-24 09:27 作者: Lumbar-Spine 時間: 2025-3-24 13:15
Zusammenfassung, Diskussion und Ausblick,nding on his/her preference. For a matching . between men and women, a pair of a man . and a woman . is called a . if both prefer each other to their current partners. A matching with no blocking pair is called ..作者: –scent 時間: 2025-3-24 17:59
https://doi.org/10.1007/978-3-642-74101-2irst non-trivial bound of . distance to the extrema of the set is presented for a single pass over streams which do not reveal their total size .. For cases with known size, an algorithm is given which guarantees a distance of Ω(..) to the extrema, which is an .-approximation for the proven best bound possible.作者: BIPED 時間: 2025-3-24 20:43
Stable Matching Problemsnding on his/her preference. For a matching . between men and women, a pair of a man . and a woman . is called a . if both prefer each other to their current partners. A matching with no blocking pair is called ..作者: 木訥 時間: 2025-3-25 01:43
Deterministic Splitter Finding in a Stream with Constant Storage and Guaranteesirst non-trivial bound of . distance to the extrema of the set is presented for a single pass over streams which do not reveal their total size .. For cases with known size, an algorithm is given which guarantees a distance of Ω(..) to the extrema, which is an .-approximation for the proven best bound possible.作者: 多產(chǎn)魚 時間: 2025-3-25 05:59
Johannes Willms,Johann Weichbrodtte is at most 1/. if the set of inequalities do not have a real solution. The latter can be checked by Mathematica. The number of inequalities generated was approximately 600 in total, and our computation time was 30 minutes using Athlon XP 2600+.作者: Engulf 時間: 2025-3-25 09:20 作者: characteristic 時間: 2025-3-25 14:16 作者: CYT 時間: 2025-3-25 19:20 作者: 印第安人 時間: 2025-3-25 21:55
Finite-State Online Algorithms and Their Automated Competitive Analysiste is at most 1/. if the set of inequalities do not have a real solution. The latter can be checked by Mathematica. The number of inequalities generated was approximately 600 in total, and our computation time was 30 minutes using Athlon XP 2600+.作者: 熱心助人 時間: 2025-3-26 01:11 作者: 思想 時間: 2025-3-26 06:19 作者: Facet-Joints 時間: 2025-3-26 12:18 作者: 口音在加重 時間: 2025-3-26 13:12
Algorithms and Computation978-3-540-49696-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 宣傳 時間: 2025-3-26 19:01
0302-9743 Overview: 978-3-540-49694-6978-3-540-49696-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: hermetic 時間: 2025-3-26 23:28
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153140.jpg作者: 樹木中 時間: 2025-3-27 03:08 作者: Eructation 時間: 2025-3-27 08:54 作者: groggy 時間: 2025-3-27 11:02
Zusammenfassung, Diskussion und Ausblick,sists of . men, . women, and each person’s preference list. A preference list is a totally ordered list including all members of the opposite sex depending on his/her preference. For a matching . between men and women, a pair of a man . and a woman . is called a . if both prefer each other to their 作者: oxidant 時間: 2025-3-27 16:19 作者: Extort 時間: 2025-3-27 20:43
https://doi.org/10.1007/978-3-642-74101-2ion between the treewidth of a graph and its largest grid minor. This min-max relation is a keystone of the Graph Minor Theory of Robertson and Seymour, which ultimately proves Wagner’s Conjecture about the structure of minor-closed graph properties..First, we obtain the only known polynomial min-ma作者: 輕打 時間: 2025-3-27 22:54
https://doi.org/10.1007/978-3-642-74101-2exponential time) algorithms for NP hard problems. In this paper we discuss the efficiency of . algorithms based on combinations of these techniques. We give several examples of possible combinations of branching and programming which provide the fastest known algorithms for a number of NP hard prob作者: 熄滅 時間: 2025-3-28 02:16 作者: happiness 時間: 2025-3-28 07:07
https://doi.org/10.1007/978-3-658-27048-3y be placed . a smaller one if their size difference is less than .. In 1992, D.?Poole suggested a natural disk-moving strategy, and computed the length of the shortest move sequence (algorithm) under its framework. However, other strategies were not considered, so the lower bound/optimality questio作者: panorama 時間: 2025-3-28 12:33
Johannes Willms,Johann Weichbrodtiven which must be labeled with equal length binary strings of minimal length such that the Hamming distance is small between words of adjacent nodes and large between words of non-adjacent nodes. For general graphs we provide algorithms that bound the word length with respect to either the maximum 作者: Incorruptible 時間: 2025-3-28 16:05
Stephanie Kaudela-Baum,Marcel Altherr cells aligned in a line. Calls arrive over time and are served by assigning frequencies to them, and no two calls emanating from the same cell or neighboring cells are assigned the same frequency. The objective is to minimize the span of frequencies used..In this paper we consider the problem with 作者: 欲望 時間: 2025-3-28 19:08
Johannes Willms,Johann Weichbrodtr bound of 1/. for the competitive ratio of ROKP, where . is a real root of 4.. + 5.. – . – 4 = 0 (. ≈0.76850 and 1/. ≈1.3012). To prove this result, we made a full use of computer programs as follows: For the base algorithm that is designed in a conventional manner, we first construct an equivalent作者: 全部 時間: 2025-3-28 23:08
Die Dynamik der Produktionsfunktions from point to point to serve these requests. To serve a request, the server needs to visit the point corresponding to that request. The objective is to minimize the total distance travelled by the server in the metric space. In order to achieve this, the server is allowed to serve the requests in 作者: 單調(diào)性 時間: 2025-3-29 04:53 作者: 燈泡 時間: 2025-3-29 11:13 作者: 溫和女孩 時間: 2025-3-29 15:11
https://doi.org/10.1007/978-3-642-84612-0mand. Each demand vertex can receive “power” from at most one supply vertex through edges in .. One thus wishes to partition . into connected components so that each component . either has no supply vertex or has exactly one supply vertex whose supply is at least the sum of demands in ., and wishes 作者: 頌揚國家 時間: 2025-3-29 18:13 作者: DIKE 時間: 2025-3-29 21:30
https://doi.org/10.1007/978-3-642-84612-0ing set of .. The size of the smallest dominating target is called dominating target number of the graph, .(.). We provide polynomial time algorithms for ., and . in dominating-pair graphs (i.e., .(.)=2). We also give approximation algorithm for . with performance ratio 2 on graphs with small domina作者: ACTIN 時間: 2025-3-30 03:10 作者: 鐵砧 時間: 2025-3-30 06:26
Wahrheit und Geschichtlichkeit,using sub-linear space and time. We study the problem of estimating aggregate path metrics .. defined as the number of pairs of vertices that have a simple path between them of length .. For a streaming undirected graph with . vertices, . edges and . components, we present an . space algorithm for e作者: 賄賂 時間: 2025-3-30 08:30
Der Mensch inmitten der Geschichtethat constructs a connected spanning subgraph .′ of . whose maximum degree is at most 14+?2./.?. If . is the Delaunay triangulation of ., and .= 2./3, we show that .′ is a .-spanner of . (for some constant .) with maximum degree at most 17, thereby improving the previously best known degree bound of作者: Acetaldehyde 時間: 2025-3-30 15:00 作者: helper-T-cells 時間: 2025-3-30 18:44
978-3-540-49694-6Springer-Verlag Berlin Heidelberg 2006作者: 黃瓜 時間: 2025-3-30 21:24 作者: Spirometry 時間: 2025-3-31 04:10 作者: confide 時間: 2025-3-31 08:36 作者: GUILE 時間: 2025-3-31 12:03
Branching and Treewidth Based Exact Algorithmsexponential time) algorithms for NP hard problems. In this paper we discuss the efficiency of . algorithms based on combinations of these techniques. We give several examples of possible combinations of branching and programming which provide the fastest known algorithms for a number of NP hard prob作者: NEEDY 時間: 2025-3-31 13:54
Deterministic Splitter Finding in a Stream with Constant Storage and Guaranteesonly access to the data. Only a constant number of reference objects from the stream can be stored for comparison with subsequent stream elements. A first non-trivial bound of . distance to the extrema of the set is presented for a single pass over streams which do not reveal their total size .. For作者: 紅潤 時間: 2025-3-31 18:08
Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rulesy be placed . a smaller one if their size difference is less than .. In 1992, D.?Poole suggested a natural disk-moving strategy, and computed the length of the shortest move sequence (algorithm) under its framework. However, other strategies were not considered, so the lower bound/optimality questio作者: 無力更進 時間: 2025-4-1 01:40 作者: negotiable 時間: 2025-4-1 02:08 作者: 阻撓 時間: 2025-4-1 07:15
Finite-State Online Algorithms and Their Automated Competitive Analysisr bound of 1/. for the competitive ratio of ROKP, where . is a real root of 4.. + 5.. – . – 4 = 0 (. ≈0.76850 and 1/. ≈1.3012). To prove this result, we made a full use of computer programs as follows: For the base algorithm that is designed in a conventional manner, we first construct an equivalent作者: 細絲 時間: 2025-4-1 12:56
Offline Sorting Buffers on Lines from point to point to serve these requests. To serve a request, the server needs to visit the point corresponding to that request. The objective is to minimize the total distance travelled by the server in the metric space. In order to achieve this, the server is allowed to serve the requests in
