標題: Titlebook: Algorithms and Computation; 11th International C Gerhard Goos,Juris Hartmanis,Shang-Hua Teng Conference proceedings 2000 Springer-Verlag Be [打印本頁] 作者: inroad 時間: 2025-3-21 16:37
書目名稱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é)科排名
作者: MAL 時間: 2025-3-21 21:43 作者: cavity 時間: 2025-3-22 04:22 作者: 我沒有命令 時間: 2025-3-22 08:09
Conference proceedings 2000e of a number of external reviewers, as indicated by the referee list found in the proceedings. There were many more acceptable papers than there was space available in the symposium program, which made the program committee’s task extremely di cult. Finally 46 papers were selected for presentation 作者: 揉雜 時間: 2025-3-22 12:40 作者: 攝取 時間: 2025-3-22 15:38
978-3-540-41255-7Springer-Verlag Berlin Heidelberg 2000作者: 憤憤不平 時間: 2025-3-22 19:56
A 2-Approximation Algorithm for Path Coloring on Trees of Rings so that two cycles corresponding to the two end-nodes of any edge have precisely one node in common. Given a set of paths on a tree of rings, the routing problem is to color the paths with the smallest number of colors so that any two paths sharing an edge are assigned different colors. We present a 2-approximation algorithm in this paper.作者: Adherent 時間: 2025-3-22 21:47 作者: SLAY 時間: 2025-3-23 03:11
Algorithms and Computation978-3-540-40996-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: laparoscopy 時間: 2025-3-23 09:07 作者: conceal 時間: 2025-3-23 13:31
Therapie im interdisziplin?ren Ansatze internally disjoint. In this paper we give a linear-time algorithm to find the maximum number of independent spanning trees rooted at any given vertex . in partial .-trees ., that is, graphs . with tree-width bounded by a constant ..作者: concert 時間: 2025-3-23 16:47 作者: exorbitant 時間: 2025-3-23 18:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153131.jpg作者: 承認 時間: 2025-3-23 23:56 作者: 重畫只能放棄 時間: 2025-3-24 04:57
https://doi.org/10.1007/978-3-662-26421-8designated source page, represented by a source node . of .. Each web page carries a weight representative of the frequency with which it is visited. By adding hotlinks, at most one per page, we are interested in minimizing the expected number of steps needed to visit a selected set of web pages fro作者: Harass 時間: 2025-3-24 09:26
https://doi.org/10.1007/978-3-8349-9250-5 . α of the sequence of memory references, which is the highest possible hit rate that any algorithm can achieve on the sequence for a cache of a given size. Our results show that . is (1-αe.)/(1-α)-competitive on any reference sequence with inherent hit rate α. Since our new competitive bound does 作者: Conquest 時間: 2025-3-24 13:39
https://doi.org/10.1007/978-3-8349-9250-5ry triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and (4) there is no competitive online routing algorithm作者: 盤旋 時間: 2025-3-24 18:24 作者: 偏見 時間: 2025-3-24 21:18
Die Machtbegriffe im Vergleich, using a local search algorithm. However, the solution space consisting of all the solutions is so large that the search requires much CPU time. In the NSP, some constraints have higher priority. Thus, we can define the solution space to be the set of solutions satisfying some of the important const作者: majestic 時間: 2025-3-25 02:23
https://doi.org/10.1007/978-3-658-43093-1al class of multipleobject auctions where a bidding algorithm consists of an initial bid sequence and an algorithm for randomly permuting the sequence. We are especially concerned with situations where some bidders know the bidding algorithms of others. For the case of only two bidders, we give an o作者: isotope 時間: 2025-3-25 04:30 作者: 增減字母法 時間: 2025-3-25 09:01 作者: Guaff豪情痛飲 時間: 2025-3-25 14:47 作者: Acetaldehyde 時間: 2025-3-25 16:37 作者: Foreshadow 時間: 2025-3-25 20:10
https://doi.org/10.1007/978-3-642-71701-7 so that two cycles corresponding to the two end-nodes of any edge have precisely one node in common. Given a set of paths on a tree of rings, the routing problem is to color the paths with the smallest number of colors so that any two paths sharing an edge are assigned different colors. We present 作者: Biguanides 時間: 2025-3-26 02:28 作者: APNEA 時間: 2025-3-26 06:40
Therapie im interdisziplin?ren Ansatze internally disjoint. In this paper we give a linear-time algorithm to find the maximum number of independent spanning trees rooted at any given vertex . in partial .-trees ., that is, graphs . with tree-width bounded by a constant ..作者: Wordlist 時間: 2025-3-26 09:21
Therapie im interdisziplin?ren Ansatz., a weight function ω : V → .+, and . ∈ .+, Weighted Vertex Cover (WVC for short) asks for a subset . of vertices in . of weight at most . such that every edge of G has at least one endpoint in .. WVC and its variants have all been shown to be .-complete. We show that, when restricting the range of作者: 獨裁政府 時間: 2025-3-26 13:25 作者: insular 時間: 2025-3-26 17:21 作者: 流浪 時間: 2025-3-26 21:36
https://doi.org/10.1007/978-3-662-26421-8We generalize the construction of Gabber and Galil to essentially every unimodular matrix in ..(.). It is shown that every parabolic or hyperbolic fractional linear transformation explicitly defines an expander of bounded degree and constant expansion. Thus all but a vanishingly small fraction of unimodular matrices define expanders.作者: macrophage 時間: 2025-3-27 03:53 作者: hidebound 時間: 2025-3-27 07:30 作者: deforestation 時間: 2025-3-27 13:17
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial CircuitsThe maximum power consumption problem on combinatorial circuits is the problem of estimating the maximum power consumption of a given combinatorial circuit. It is easy to see that this problem for general circuits is hard to approximate within a factor of .. 作者: GLIDE 時間: 2025-3-27 13:53
Voronoi-Based Systems of Coordinates and Surface ReconstructionSibson in 1980. It is defined geometrically from the Voronoi diagram of the points and has nice properties that make it suitable for scattered data interpolation. Since then, other systems of coordinates have been proposed, resulting in new theoretical insights and new applications. The case where t作者: condemn 時間: 2025-3-27 21:08
Strategies for Hotlink Assignmentsdesignated source page, represented by a source node . of .. Each web page carries a weight representative of the frequency with which it is visited. By adding hotlinks, at most one per page, we are interested in minimizing the expected number of steps needed to visit a selected set of web pages fro作者: Overdose 時間: 2025-3-27 23:52
A New Competitive Analysis of Randomized Caching . α of the sequence of memory references, which is the highest possible hit rate that any algorithm can achieve on the sequence for a cache of a given size. Our results show that . is (1-αe.)/(1-α)-competitive on any reference sequence with inherent hit rate α. Since our new competitive bound does 作者: 嘲弄 時間: 2025-3-28 04:47
Online Routing in Convex Subdivisionsry triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and (4) there is no competitive online routing algorithm作者: promote 時間: 2025-3-28 07:54
A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors the problem has made significant progress recently, which, however, seems not to imply practical algorithms for the problem, yet. Practical algorithms have been developed only for systems with three processors and the techniques seem dificult to extend to systems with more than three processors. Th作者: Panacea 時間: 2025-3-28 13:00 作者: Benzodiazepines 時間: 2025-3-28 17:53 作者: 助記 時間: 2025-3-28 19:59 作者: 傳授知識 時間: 2025-3-28 23:54 作者: 秘密會議 時間: 2025-3-29 06:25 作者: EXULT 時間: 2025-3-29 09:39 作者: 厭食癥 時間: 2025-3-29 13:37
A 2-Approximation Algorithm for Path Coloring on Trees of Rings so that two cycles corresponding to the two end-nodes of any edge have precisely one node in common. Given a set of paths on a tree of rings, the routing problem is to color the paths with the smallest number of colors so that any two paths sharing an edge are assigned different colors. We present 作者: 瑣事 時間: 2025-3-29 16:14
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree paper, we show that the Hamiltonian path completion problem will unlikely have any constant ratio approximation algorithm unless NP = P. This problem remains hard to approximate even when the given subgraph is a tree. Moreover, if the edge weights are restricted to be either 1 or 2, the Hamiltonian作者: mucous-membrane 時間: 2025-3-29 20:24
Finding Independent Spanning Trees in Partial ,-Treese internally disjoint. In this paper we give a linear-time algorithm to find the maximum number of independent spanning trees rooted at any given vertex . in partial .-trees ., that is, graphs . with tree-width bounded by a constant ..作者: 執(zhí)拗 時間: 2025-3-30 03:54
On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover., a weight function ω : V → .+, and . ∈ .+, Weighted Vertex Cover (WVC for short) asks for a subset . of vertices in . of weight at most . such that every edge of G has at least one endpoint in .. WVC and its variants have all been shown to be .-complete. We show that, when restricting the range of作者: 鑲嵌細工 時間: 2025-3-30 06:50 作者: malapropism 時間: 2025-3-30 08:13
A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Planem runs in . log .) time with . space, and is simple enough to easily implement on resource restricted machines. It constructs a tour essentially by axis-sorts of the points and takes a kind of the ‘fixed dissection strategy,’ though it neither tries to find best tours in subregions nor optimizes the作者: gnarled 時間: 2025-3-30 16:17 作者: Cardioplegia 時間: 2025-3-30 19:12
On Approximating Minimum Vertex Cover for Graphs with Perfect Matchingtex Cover problem on general graphs. Approximation algorithms for VC-PM are developed, which induce improvements over previously known algorithms on sparse graphs. For example, for graphs of average degree 5, the approximation ratio of our algorithm is 1.414, compared with the previously best ratio 1.615 by Halldórsson and Radhakrishnan.作者: 有發(fā)明天才 時間: 2025-3-31 00:12
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree path completion problem on a tree is still NP-hard. Then it is shown that this problem will unlikely have any fully polynomial-time approximation scheme (FPTAS) unless NP=P. When the given tree is a .-tree, we give an approximation algorithm with performance ratio 1.5.作者: panorama 時間: 2025-3-31 02:33
Der Luftverkehr und seine Subventionents on a surface is closely related to the way the Voronoi diagram of the sample points approaches the medial axis of the surface when the sampling density increases. Elucidating the question of approximating the medial axis of a surface leads to new theoretical results in surface reconstruction and new algorithms with provable guarantees.作者: 光明正大 時間: 2025-3-31 08:02 作者: 嘴唇可修剪 時間: 2025-3-31 12:26
Die Machtbegriffe im Vergleich, This paper gives theoretical support for using 4-opt-type neighborhood operations by discussing the connectivity of its solution space and the size of the neighborhood. Another interesting point in our model is a special case of the NSP corresponds to the bipartite transportation problem, and our result also applies to it.作者: voluble 時間: 2025-3-31 15:19
Therapie im interdisziplin?ren Ansatz weight of the vertex cover we are looking for, but the number of vertices in a minimum weight vertex cover, then the same running time can be obtained. If the weights are arbitrary (referred to by General-WVC), however, the problem is not fixed parameter tractable unless . = ..作者: COM 時間: 2025-3-31 19:56 作者: 食道 時間: 2025-3-31 23:06
Voronoi-Based Systems of Coordinates and Surface Reconstructionts on a surface is closely related to the way the Voronoi diagram of the sample points approaches the medial axis of the surface when the sampling density increases. Elucidating the question of approximating the medial axis of a surface leads to new theoretical results in surface reconstruction and new algorithms with provable guarantees.作者: mediocrity 時間: 2025-4-1 04:15 作者: 預(yù)防注射 時間: 2025-4-1 09:41 作者: 背帶 時間: 2025-4-1 11:11 作者: 騷擾 時間: 2025-4-1 15:03
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width of Robertson and Seymour imply (non-constructively) that . these problems are fixed parameter tractable. In this paper we give a .. of this fact. Moreover, the algorithms of our proof are optimal and able to output the corresponding pair (.) in case of an affirmative answer.作者: 誰在削木頭 時間: 2025-4-1 19:40
B. J. R. Whittle,J. Lopez-Belmontehen its assumption set consists of all propositional literals (i.e., an answer for a given query is allowed to include any positive literals), and show that it can be done in polynomial time if the knowledge-base is Horn, while it remains NP-complete for the general case. Some other solvable cases are also discussed.作者: BRAWL 時間: 2025-4-2 00:37 作者: SPASM 時間: 2025-4-2 06:35
