標(biāo)題: Titlebook: Algorithms and Computation; 19th International S Seok-Hee Hong,Hiroshi Nagamochi,Takuro Fukunaga Conference proceedings 2008 Springer-Verla [打印本頁] 作者: Coarse 時(shí)間: 2025-3-21 19:31
書目名稱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é)科排名
作者: 機(jī)械 時(shí)間: 2025-3-21 21:38
https://doi.org/10.1007/978-3-662-64192-7he 2-deletion problem and prove that the optimal tree is a balanced tree with certain root degree 5?≤?.?≤?7 where the number of leaves in the subtrees differs by at most one and each subtree is a 2-3 tree.作者: fleeting 時(shí)間: 2025-3-22 04:10 作者: ABHOR 時(shí)間: 2025-3-22 06:24 作者: 人類 時(shí)間: 2025-3-22 10:09
https://doi.org/10.1007/978-3-662-59997-6f that a vertex . receives, given the actions chosen by all vertices, equals the total number of vertices that have chosen the same color as ., unless a neighbor of . has also chosen the same color, in which case the payoff of . is 0. We show: 作者: Meditative 時(shí)間: 2025-3-22 13:32
K?lner Schriften zum Medizinrecht that the problem is hard to approximate to within a constant factor, under both. On the positive side, we describe a simple algorithm that achieves a 3/4 approximation ratio for one of these approximation notions. We also prove similar results for a version of many-one matching.作者: braggadocio 時(shí)間: 2025-3-22 18:53 作者: bisphosphonate 時(shí)間: 2025-3-22 22:59
Greedy Construction of 2-Approximation Minimum Manhattan Networkapproximation algorithm with time complexity .(.log.), which improves the 2-approximation algorithm with time complexity .(.). Moreover, compared with other 2-approximation algorithms employing linear programming or dynamic programming technique, it was first discovered that only greedy strategy suffices to get 2-approximation network.作者: insightful 時(shí)間: 2025-3-23 04:32
Optimal Key Tree Structure for Deleting Two or More Leaveshe 2-deletion problem and prove that the optimal tree is a balanced tree with certain root degree 5?≤?.?≤?7 where the number of leaves in the subtrees differs by at most one and each subtree is a 2-3 tree.作者: 間諜活動(dòng) 時(shí)間: 2025-3-23 08:52 作者: GROUP 時(shí)間: 2025-3-23 12:20 作者: 下級 時(shí)間: 2025-3-23 17:43
A Game Theoretic Approach for Efficient Graph Coloringf that a vertex . receives, given the actions chosen by all vertices, equals the total number of vertices that have chosen the same color as ., unless a neighbor of . has also chosen the same color, in which case the payoff of . is 0. We show: 作者: 仔細(xì)閱讀 時(shí)間: 2025-3-23 19:35
0302-9743 ustralia, December 15–17, 2008. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Daejeon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), Vancouver (2002), Kyoto (2003), Hong Kong (2004作者: anachronistic 時(shí)間: 2025-3-24 00:13
https://doi.org/10.1007/978-3-663-04575-5e static problem is to compute dominators and related information on a flowgraph. This problem has been solved, but the solution is complicated, and there are related problems that are not so well understood. The work to be discussed is by colleagues, other researchers, and the speaker.作者: creatine-kinase 時(shí)間: 2025-3-24 04:29 作者: 聽覺 時(shí)間: 2025-3-24 09:59
Reachability Problems on Directed Graphse static problem is to compute dominators and related information on a flowgraph. This problem has been solved, but the solution is complicated, and there are related problems that are not so well understood. The work to be discussed is by colleagues, other researchers, and the speaker.作者: VEIL 時(shí)間: 2025-3-24 13:29
Improving the Competitive Ratio of the Online OVSF Code Assignment Problemio were 10 and 5/3, respectively. In this paper, we improve them to 7 and 2, respectively. We also show that our analysis for the upper bound is tight by giving an input sequence for which the competitive ratio of our algorithm is 7???. for arbitrary .>?0.作者: Incommensurate 時(shí)間: 2025-3-24 16:53
Alternativen der medialen Entwicklung, unless ., there is no polynomial-time approximation algorithm with a ratio of size (1???.(1))ln ln . for the following problem: Given pairs of vertices in an undirected graph of bounded treewidth, determine the minimal possible number . for which all except . pairs can be connected by disjoint paths.作者: 譏笑 時(shí)間: 2025-3-24 22:19 作者: fatty-acids 時(shí)間: 2025-3-25 02:08
Michael Markert,Ina Katharina Uphoffa matching lower bound. Finally, we combine the ideas and obtain an .(.· max {1,log(./.)}) time algorithm that selects a subarray storing the .’th largest sum among all subarrays of length at least . and at most ..作者: 嬉耍 時(shí)間: 2025-3-25 06:45
https://doi.org/10.1007/978-3-662-59997-6s; as a corollary we obtain that the price of anarchy in stars is exactly?2. We also prove constant bounds for the price of anarchy in chains and rings in which the number of wavelengths is relatively small compared to the load of the network; in the opposite case we show that the price of anarchy is unbounded.作者: flourish 時(shí)間: 2025-3-25 09:23 作者: OFF 時(shí)間: 2025-3-25 11:59 作者: 大漩渦 時(shí)間: 2025-3-25 18:06
Selecting Sums in Arraysa matching lower bound. Finally, we combine the ideas and obtain an .(.· max {1,log(./.)}) time algorithm that selects a subarray storing the .’th largest sum among all subarrays of length at least . and at most ..作者: Senescent 時(shí)間: 2025-3-25 21:12
On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networkss; as a corollary we obtain that the price of anarchy in stars is exactly?2. We also prove constant bounds for the price of anarchy in chains and rings in which the number of wavelengths is relatively small compared to the load of the network; in the opposite case we show that the price of anarchy is unbounded.作者: 積習(xí)已深 時(shí)間: 2025-3-26 03:04 作者: 詼諧 時(shí)間: 2025-3-26 04:52
Algorithms and Computation978-3-540-92182-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 閃光東本 時(shí)間: 2025-3-26 10:26
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153135.jpg作者: abolish 時(shí)間: 2025-3-26 14:18
,Einflu? der Aufprallgeschwindigkeit,Graph Drawing is the art and science of making pictures of graphs. Planarity has always played a central role in graph drawing research. Effective, efficient and elegant methods for drawing planar graphs were developed over the course of the last century by Wagner, Hopcroft and Tarjan, Read, de Frassieux, Pach and Pollack, amongst others.作者: ear-canal 時(shí)間: 2025-3-26 20:01 作者: 動(dòng)機(jī) 時(shí)間: 2025-3-26 23:23 作者: 現(xiàn)實(shí) 時(shí)間: 2025-3-27 03:23 作者: PLAYS 時(shí)間: 2025-3-27 06:36
https://doi.org/10.1007/978-3-662-63618-3hms which require no extra array of size depending on input size . but use only constant working storage cells (variables), each having .(log.) bits. As an example, consider a problem of finding the median among . given numbers. A linear-time algorithm for the problem is well known. An ordinary impl作者: 元音 時(shí)間: 2025-3-27 09:33 作者: Anecdote 時(shí)間: 2025-3-27 17:29
https://doi.org/10.1007/978-3-662-31651-1 there exists a path (named a Manhattan path) of the length exactly the Manhattan distance between . and .. The Minimum Manhattan Network problem is to find a Manhattan network of the minimum length, ., the total length of the segments of the network is to be minimized. In this paper we present a 2-作者: Factual 時(shí)間: 2025-3-27 20:33
Alternativen der medialen Entwicklungants of recoloring a colored graph with minimal cost such that the resulting coloring is convex. Two variants of the problem are shown to be .-hard on trees even if in the initial coloring each color is used to color only a bounded number of vertices. For graphs of bounded treewidth, we present a po作者: Fallibility 時(shí)間: 2025-3-28 00:50
Alternativen der medialen Entwicklungltiobjective problem where . types of points (customers) in the plane have to be covered by disks (base stations) such that the number of disks is minimized and for each type of points, the number of covered points is maximized. Our approximation scheme can be extended so that it works with the foll作者: AWRY 時(shí)間: 2025-3-28 03:34
Michael Markert,Ina Katharina Uphoff and performances of online algorithms have been analyzed by the competitive analysis. The previous best upper and lower bounds on the competitive ratio were 10 and 5/3, respectively. In this paper, we improve them to 7 and 2, respectively. We also show that our analysis for the upper bound is tight作者: prosthesis 時(shí)間: 2025-3-28 09:45 作者: 固定某物 時(shí)間: 2025-3-28 12:17
Michael Markert,Ina Katharina Uphoffe colored using as few colors as possible. In the max-coloring problem, a fixed number of colors is given, and as many edges as possible should be colored. Previous analysis using the competitive ratio has not separated the performance of First-Fit and Next-Fit, but intuition suggests that First-Fit作者: Transfusion 時(shí)間: 2025-3-28 18:11 作者: Ornithologist 時(shí)間: 2025-3-28 19:18
https://doi.org/10.1007/978-3-662-64192-7e is represented succinctly. Our first result is for bottom-up traversal that starts with a node in the tree . and traverses a path to the root. For blocks of size ., a tree on . nodes, and for a path of length ., we design data structures that permit traversal of the bottom-up path in .(./.) I/Os u作者: growth-factor 時(shí)間: 2025-3-29 01:45 作者: 美學(xué) 時(shí)間: 2025-3-29 03:43 作者: 用手捏 時(shí)間: 2025-3-29 07:32
Zivilrechtliche Standardermittlunghe isolation game is inspired by the Voronoi game, competitive facility location, and geometric sampling. In the Voronoi game studied by Dürr and Thang, each player’s objective is to maximize the area of her Voronoi region. In contrast, in the isolation game, each player’s objective is to position h作者: extinguish 時(shí)間: 2025-3-29 13:00
https://doi.org/10.1007/978-3-662-59997-6k. Each player is charged according to the maximum fiber multiplicity that her color (wavelength) choice incurs and the social cost is the maximum player cost. We investigate the price of anarchy of such games and provide two different upper bounds for general graphs—namely the number of wavelengths作者: Occipital-Lobe 時(shí)間: 2025-3-29 18:52
K?lner Schriften zum Medizinrechtons of this type are called . or . problems in the economic literature, and are the subject of a rich body of work..From the computer science perspective, it is natural to study the complexity of rationalization in various scenarios. We consider a class of rationalization problems in which the econo作者: Expediency 時(shí)間: 2025-3-29 21:14 作者: 鴿子 時(shí)間: 2025-3-30 01:10 作者: 溫和女孩 時(shí)間: 2025-3-30 04:57 作者: 你不公正 時(shí)間: 2025-3-30 10:22
Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?1/.) working space for any small positive constant .. The algorithm finds the median without altering any element of an input array. In other words, the input array is considered as a read-only array.作者: 獸皮 時(shí)間: 2025-3-30 12:42
Multiobjective Disk Cover Admits a PTASem to a single objective) often used for such problems can significantly degrade their approximability. We can show non-approximability results for several single-objective restrictions of multiobjective disk cover problems. For example, if there are 2 types of customers, then maximizing the supplie作者: 名字 時(shí)間: 2025-3-30 18:48 作者: 致詞 時(shí)間: 2025-3-30 20:55
The Isolation Game: A Game of Distancesbrium exists, using either a very simple farness measure in an asymmetric space or a slightly more sophisticated farness measure in a symmetric space. Complementing to these hardness results, we establish existence theorems for several special families of farness measures in symmetric spaces: We pro作者: Critical 時(shí)間: 2025-3-31 02:48 作者: hedonic 時(shí)間: 2025-3-31 05:46 作者: adulterant 時(shí)間: 2025-3-31 10:37
Alternativen der medialen Entwicklungem to a single objective) often used for such problems can significantly degrade their approximability. We can show non-approximability results for several single-objective restrictions of multiobjective disk cover problems. For example, if there are 2 types of customers, then maximizing the supplie作者: Accolade 時(shí)間: 2025-3-31 14:21
Michael Markert,Ina Katharina Uphoffre . can be chosen to suit the available memory. Furthermore, the algorithm processes the suffix array, and outputs the LCP, strictly left-to-right, making it suitable for use with external memory. We show experimentally that for many naturally occurring strings our algorithm is faster than the line作者: 勉強(qiáng) 時(shí)間: 2025-3-31 18:03
Zivilrechtliche Standardermittlungbrium exists, using either a very simple farness measure in an asymmetric space or a slightly more sophisticated farness measure in a symmetric space. Complementing to these hardness results, we establish existence theorems for several special families of farness measures in symmetric spaces: We pro作者: 熱情的我 時(shí)間: 2025-3-31 21:41
Conference proceedings 2008am Committee and many other external reviewers. After an extremely rigorous review process and extensive discussion, the Committee selected 78 papers. We hope all accepted papers will eventually appear in scienti?c journals in a more polished form. Two special issues, one of Algorithmica and one of 作者: opportune 時(shí)間: 2025-4-1 05:26
Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?hms which require no extra array of size depending on input size . but use only constant working storage cells (variables), each having .(log.) bits. As an example, consider a problem of finding the median among . given numbers. A linear-time algorithm for the problem is well known. An ordinary impl作者: inflate 時(shí)間: 2025-4-1 09:33
