標(biāo)題: Titlebook: Algorithms and Computation; 22nd International S Takao Asano,Shin-ichi Nakano,Osamu Watanabe Conference proceedings 2011 Springer-Verlag Gm [打印本頁] 作者: JAR 時間: 2025-3-21 17:35
書目名稱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é)科排名
作者: fixed-joint 時間: 2025-3-21 22:15 作者: ADORN 時間: 2025-3-22 00:40 作者: 膽小懦夫 時間: 2025-3-22 06:47
Algorithm Engineering for Route Planning – An Update –icular, new theoretical insights on when and why those techniques work so well will be discussed. The main part of the talk will focus on variants of the problem that occur in more realistic traffic scenarios.作者: 直覺好 時間: 2025-3-22 09:33
Improved Approximations for Buy-at-Bulk and Shallow-Light ,-Steiner Trees and (,,2)-Subgraph.(log..),.(log.))-approximation for SL.ST: the algorithm finds a .-Steiner tree of diameter at most .(.·log.) whose cost is at most . where . is the cost of an LP relaxation of the problem. This improves on the algorithm of [9] with ratio (.(log..), .(log..)). Using this, we obtain an .(log..)-appro作者: 尖 時間: 2025-3-22 13:03
Path Queries in Weighted Treestructure can also support path reporting queries in . time, where . is the size of output. In addition, we present a data structure that answers path reporting queries in . time, using . space. These are the first data structures that answer path reporting queries.作者: Subdue 時間: 2025-3-22 19:06 作者: receptors 時間: 2025-3-23 00:31
Michael Th. Greven,Oliver von Wrochemo smallest congruent disks such that each disk in . intersects one of these two disks. Then we study the problem of covering the set . by two smallest congruent disks. We give exact and approximation algorithms for these versions.作者: geometrician 時間: 2025-3-23 04:02 作者: nostrum 時間: 2025-3-23 08:36
Covering and Piercing Disks with Two Centerso smallest congruent disks such that each disk in . intersects one of these two disks. Then we study the problem of covering the set . by two smallest congruent disks. We give exact and approximation algorithms for these versions.作者: Nmda-Receptor 時間: 2025-3-23 12:52
Robustness of Minimum Cost Arborescencese precisely, we characterize an input graph in which the optimal objective value does not change even if we remove several arcs. Our characterizations lead to efficient algorithms for checking robustness of an input graph.作者: LAY 時間: 2025-3-23 17:42
Der Krieg als autopoietisches Systemcomputation of shortest paths is a classical problem that can be solved by Dijkstra’s shortest paths algorithm. However, for the huge datasets that frequently appear in route planning the algorithm is far too slow. Recently, algorithms for route planning in transportation networks have undergone a r作者: lavish 時間: 2025-3-23 19:27 作者: Palpitation 時間: 2025-3-24 00:47 作者: Isolate 時間: 2025-3-24 03:33 作者: canvass 時間: 2025-3-24 06:38 作者: Forsake 時間: 2025-3-24 12:30 作者: myopia 時間: 2025-3-24 18:28 作者: florid 時間: 2025-3-24 19:26 作者: nerve-sparing 時間: 2025-3-25 01:22
Kriegsgefangene und ihre Heimkehr in read-only memory and only few working variables can be used. The first algorithm uses a constant number of variables, and outputs the vertices of the visibility polygon in . time, where . denotes the number of reflex vertices of . that are part of the output. The next two algorithms use .(log.) 作者: MEET 時間: 2025-3-25 05:14 作者: 壯麗的去 時間: 2025-3-25 11:16
https://doi.org/10.1007/978-3-662-26424-9=?(.,.), denoted as .., is a graph with the set of vertices ., in which two vertices are connected by an edge if there exists a path of length at most 2 connecting them in .. Harary & Schwenk (1971) proved that the square of a tree . contains a Hamiltonian cycle if and only if . is a caterpillar, i.作者: Constant 時間: 2025-3-25 15:15 作者: 物質(zhì) 時間: 2025-3-25 18:25
https://doi.org/10.1007/978-3-662-34644-0 such that .. connects .. and .., for .?=?1,…,.. We study a natural variant of this problem, where the vertices of .. must belong to a specified vertex subset .. for .?=?1,…,.. In contrast to the original problem, which is polynomial-time solvable for any fixed integer ., we show that this variant i作者: Projection 時間: 2025-3-25 20:41 作者: 引導(dǎo) 時間: 2025-3-26 00:23 作者: GET 時間: 2025-3-26 06:40 作者: 寬宏大量 時間: 2025-3-26 10:03 作者: BUOY 時間: 2025-3-26 13:38
Elemente und Strukturen des Kriminalromans,n integer .?>?0, return the .-th smallest .-coordinate from the set of points that have .-coordinates in .. We present a linear space data structure that maintains a dynamic set of . points in the plane with real coordinates, and supports range selection queries in . time, as well as insertions and 作者: GENUS 時間: 2025-3-26 20:08
https://doi.org/10.1007/978-3-476-03896-8re uses linear space and supports insertions and deletions in .(log.) and .(log./loglog.) amortized time respectively..We also describe a .(.(log./loglog.).) space data structure that answers .-dimensional stabbing-max queries in .( (log./loglog.).) time. Insertions and deletions are supported in .(作者: Infirm 時間: 2025-3-27 00:32 作者: addition 時間: 2025-3-27 01:29
978-3-642-25590-8Springer-Verlag GmbH Berlin Heidelberg 2011作者: penance 時間: 2025-3-27 05:43 作者: OTHER 時間: 2025-3-27 13:21 作者: 休戰(zhàn) 時間: 2025-3-27 13:37
Conference proceedings 2011in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational compl作者: 發(fā)怨言 時間: 2025-3-27 21:37 作者: crescendo 時間: 2025-3-28 00:10 作者: 撕裂皮肉 時間: 2025-3-28 05:24 作者: 證明無罪 時間: 2025-3-28 08:06 作者: 拖債 時間: 2025-3-28 10:26
https://doi.org/10.1007/978-3-662-34644-0ph is chordal. We use this result to show that, for any fixed graph ., the problems .-. and .-. can be solved in polynomial time on chordal graphs. These problems are to decide whether an input graph . contains . as a contraction or as an induced minor, respectively.作者: 激怒某人 時間: 2025-3-28 17:59 作者: Pedagogy 時間: 2025-3-28 20:32
The School Bus Problem on Trees gap of the natural set-cover formulation for this problem is also bounded by 4. We also present a constant approximation for the variant where we have a fixed number of buses to use, and the goal is to minimize the maximum regret.作者: 6Applepolish 時間: 2025-3-29 01:41 作者: alabaster 時間: 2025-3-29 06:43
Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radiusication radius larger than .. to a sensor, where .. is the minimum value needed to obtain strong connectivity. We also show that Ω(log.) interference is needed for some instances, making our algorithms asymptotically optimal.作者: 蠟燭 時間: 2025-3-29 09:32
Dominating Induced Matchings for ,,-free Graphs in Linear Timelexity was open for ..-free graphs for any .?≥?5; .. denotes a chordless path with . vertices and .???1 edges. We show in this paper that the weighted DIM problem is solvable in linear time for ..-free graphs in a robust way.作者: Dislocation 時間: 2025-3-29 14:11
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Pathsph is chordal. We use this result to show that, for any fixed graph ., the problems .-. and .-. can be solved in polynomial time on chordal graphs. These problems are to decide whether an input graph . contains . as a contraction or as an induced minor, respectively.作者: 燈泡 時間: 2025-3-29 17:10
Dynamic Range Majority Data Structuresues of ., this improved query time matches an existing lower bound, for any data structure with polylogarithmic update time. We also generalize our data structure to handle sets of points in .-dimensions, for .?≥?2, as well as dynamic arrays, in which each entry is a colour.作者: Glucose 時間: 2025-3-29 22:52
0302-9743 ernational Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as appr作者: nepotism 時間: 2025-3-30 00:11
https://doi.org/10.1007/978-3-8350-5467-7thms for problems such as MAX-CUT, MAX-3SAT, SPARSEST CUT, GRAPH COLORING, etc. The talk will survey this area, as well as its fascinating connections with topics such as geometric embeddings of metric spaces, and Khot’s unique games conjecture..The talk will be self-contained.作者: flaunt 時間: 2025-3-30 08:08 作者: 譏諷 時間: 2025-3-30 11:23
Kriegsgefangene und ihre Heimkehrthe visibility polygon in . time, where . denotes the number of reflex vertices of . that are part of the output. The next two algorithms use .(log.) variables, and output the visibility polygon in .(.log.) randomized expected time or .(.log..) deterministic time, where . is the number of reflex vertices of ..作者: 身體萌芽 時間: 2025-3-30 13:57 作者: 刪除 時間: 2025-3-30 17:32
Semidefinite Programming and Approximation Algorithms: A Surveythms for problems such as MAX-CUT, MAX-3SAT, SPARSEST CUT, GRAPH COLORING, etc. The talk will survey this area, as well as its fascinating connections with topics such as geometric embeddings of metric spaces, and Khot’s unique games conjecture..The talk will be self-contained.作者: 天賦 時間: 2025-3-31 00:40 作者: atopic-rhinitis 時間: 2025-3-31 03:25 作者: 減震 時間: 2025-3-31 06:07
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Timelog.).) space data structure that answers .-dimensional stabbing-max queries in .( (log./loglog.).) time. Insertions and deletions are supported in .((log./loglog.).loglog.) and .((log./loglog.).) amortized time respectively.作者: 現(xiàn)實(shí) 時間: 2025-3-31 10:26 作者: outskirts 時間: 2025-3-31 16:46
Dynamic Range Selection in Linear Spacedeletions in . amortized time. The space usage of this data structure is an . factor improvement over the previous best result, while maintaining asymptotically matching query and update times. We also present a succinct data structure that supports range selection queries on a dynamic array of . values drawn from a bounded universe.作者: detach 時間: 2025-3-31 20:32 作者: Robust 時間: 2025-4-1 01:09 作者: 紳士 時間: 2025-4-1 01:53
Elemente und Strukturen des Kriminalromans,deletions in . amortized time. The space usage of this data structure is an . factor improvement over the previous best result, while maintaining asymptotically matching query and update times. We also present a succinct data structure that supports range selection queries on a dynamic array of . values drawn from a bounded universe.作者: Externalize 時間: 2025-4-1 09:42
0302-9743 graph drawing and information visualization; optimization; online and streaming algorithms; parallel and external memory algorithms; parameterized algorithms; game theory and internet algorithms; randomized algorithms; and string algorithms.978-3-642-25590-8978-3-642-25591-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
