標(biāo)題: Titlebook: Algorithms and Computation; 20th International S Yingfei Dong,Ding-Zhu Du,Oscar Ibarra Conference proceedings 2009 Springer-Verlag Berlin H [打印本頁(yè)] 作者: Capricious 時(shí)間: 2025-3-21 18:34
書目名稱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é)科排名
作者: 脫落 時(shí)間: 2025-3-21 23:18 作者: 座右銘 時(shí)間: 2025-3-22 03:26 作者: 受人支配 時(shí)間: 2025-3-22 05:34 作者: N斯巴達(dá)人 時(shí)間: 2025-3-22 11:17 作者: Foolproof 時(shí)間: 2025-3-22 14:17
On Protein Structure Alignment under Distance Constraint,In this paper we mainly show that the CMO problem under these conditions: (1) is NP-hard, but (2) allows a PTAS. The rest of this paper shows algorithms for the LCP problem which improves on known results.作者: –吃 時(shí)間: 2025-3-22 20:24
Bubblesort and Juggling Sequences, to analyze various juggling patterns. The analysis leads to new results on the joint distribution of the descent and maximum drop statistics of a permutation, as well as a new class of identities for the classical Eulerian numbers.作者: Innovative 時(shí)間: 2025-3-22 22:54
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems,zed where . is a non-negative submodular function on ., and . is a fixed integer. This problem contains the hypergraph .-cut problem. In this paper, we design the first exact algorithm for .?=?3 and approximation algorithms for .?≥?4. We also analyze the approximation factor for the hypergraph .-cut problem.作者: 粉筆 時(shí)間: 2025-3-23 03:18 作者: Concerto 時(shí)間: 2025-3-23 07:26
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153134.jpg作者: BLOT 時(shí)間: 2025-3-23 11:54
https://doi.org/10.1007/978-3-642-10631-6AAC; algorithms; combinatorial optimization; complexity; computational geometry; data structures; optimiza作者: deviate 時(shí)間: 2025-3-23 15:42 作者: 行業(yè) 時(shí)間: 2025-3-23 20:41
Landeplatzsuche und die Landung von Viking, to analyze various juggling patterns. The analysis leads to new results on the joint distribution of the descent and maximum drop statistics of a permutation, as well as a new class of identities for the classical Eulerian numbers.作者: justify 時(shí)間: 2025-3-24 00:58
,Was wissen wir bereits über den Mars?,unction and a means to predict possible changes of structural flexibility by the environmental factors such as temperature and pH. Several methods were developed for this purpose..One of standard methods is to model the protein as a geometric graph embedded in ?. by regarding an atom as a vertex and作者: Abominate 時(shí)間: 2025-3-24 05:26
Welche Probleme erwarten uns auf dem Mars?,raph?. and two optimization versions where one asks for a maximum- and a minimum-size dominating clique, if any. For the three problems we propose optimal algorithms with provably worst-case upper bounds improving existing ones by (D.?Kratsch and M.?Liedloff, ., Theoretical Computer Science?385(1-3)作者: 誘拐 時(shí)間: 2025-3-24 08:24
https://doi.org/10.1007/978-3-662-26420-1 compounds composed of carbon, hydrogen, oxygen and nitrogen atoms whose graphical structures are tree-like graphs, and consider stereoisomers caused only by asymmetry around carbon atoms. We introduce a mathematical representation for stereoisomers, and propose a dynamic programming algorithm of ge作者: cavity 時(shí)間: 2025-3-24 11:18 作者: 灌輸 時(shí)間: 2025-3-24 15:37 作者: 葡萄糖 時(shí)間: 2025-3-24 21:22
Handbibliothek für Bauingenieures problem is NP-hard [11] and the best previous practical solution is a 38-approximation algorithm by Carmi et al. [4]. We first consider the line-separable discrete unit disk cover problem (the set of disk centres can be separated from the set of points by a line) for which we present an .(...)-tim作者: 事與愿違 時(shí)間: 2025-3-24 23:17
https://doi.org/10.1007/978-3-662-39552-3zed where . is a non-negative submodular function on ., and . is a fixed integer. This problem contains the hypergraph .-cut problem. In this paper, we design the first exact algorithm for .?=?3 and approximation algorithms for .?≥?4. We also analyze the approximation factor for the hypergraph .-cut作者: Anticonvulsants 時(shí)間: 2025-3-25 05:00
https://doi.org/10.1007/978-3-662-39552-3 between every two of these points that are sufficiently close. Given two proteins represented this way, our problem is to find a subset of points from each protein, and a bijective matching of points between these two subsets, with the objective of maximizing either (A) the size of the subsets (LCP作者: 正式演說 時(shí)間: 2025-3-25 11:07
Der Mathematikunterricht in der Primarstufeame set of rectangles exists. In this paper, we use it to show the existence of a polynomial-time approximation scheme for 2-dimensional geometric knapsack in the case where the range of the profit to area ratio of the rectangles is bounded by a constant. As a corollary, we get an approximation sche作者: 青少年 時(shí)間: 2025-3-25 14:28 作者: Goblet-Cells 時(shí)間: 2025-3-25 18:59 作者: FANG 時(shí)間: 2025-3-25 20:18 作者: colony 時(shí)間: 2025-3-26 03:20 作者: magenta 時(shí)間: 2025-3-26 06:21
Das Verbraucherschutzstrafrechtor any convex body . in the plane, the average distance from the Fermat-Weber center of . to the points of . is larger than ., where Δ(.) is the diameter of .. This proves a conjecture of Carmi, Har-Peled and Katz. From the other direction, we prove that the same average distance is at most .. The n作者: Carcinogen 時(shí)間: 2025-3-26 12:32
https://doi.org/10.1007/978-3-662-29153-5dy this problem in a more general setting. We consider the generalized problem which tries to resolve set .?=?{..,..,???,..} from pairwise function values {.(..,..) | 1?≤?., .?≤?.} for a given bivariate function .. We call this problem the . problem. Our results include efficient algorithms when . i作者: 慢慢沖刷 時(shí)間: 2025-3-26 15:55 作者: 多骨 時(shí)間: 2025-3-26 17:54 作者: Morose 時(shí)間: 2025-3-27 00:33 作者: corpuscle 時(shí)間: 2025-3-27 01:46 作者: Hdl348 時(shí)間: 2025-3-27 05:57 作者: HARP 時(shí)間: 2025-3-27 10:33 作者: Radiculopathy 時(shí)間: 2025-3-27 14:21 作者: 閃光你我 時(shí)間: 2025-3-27 20:58
Bubblesort and Juggling Sequences, to analyze various juggling patterns. The analysis leads to new results on the joint distribution of the descent and maximum drop statistics of a permutation, as well as a new class of identities for the classical Eulerian numbers.作者: 征服 時(shí)間: 2025-3-27 22:30 作者: organic-matrix 時(shí)間: 2025-3-28 02:40 作者: cluster 時(shí)間: 2025-3-28 09:57
Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming, compounds composed of carbon, hydrogen, oxygen and nitrogen atoms whose graphical structures are tree-like graphs, and consider stereoisomers caused only by asymmetry around carbon atoms. We introduce a mathematical representation for stereoisomers, and propose a dynamic programming algorithm of ge作者: kindred 時(shí)間: 2025-3-28 14:21
Exact Algorithms for the Bottleneck Steiner Tree Problem,edge length of the resulting Steiner tree is minimized. In this paper, we study this problem in any .. metric. We present the first fixed-parameter tractable algorithm running in .(.(.)·..log.) time for the .. and the .. metrics, and the first exact algorithm for any other .. metric with 1?
作者: 長(zhǎng)矛 時(shí)間: 2025-3-28 18:38 作者: 公共汽車 時(shí)間: 2025-3-28 19:15
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm,s problem is NP-hard [11] and the best previous practical solution is a 38-approximation algorithm by Carmi et al. [4]. We first consider the line-separable discrete unit disk cover problem (the set of disk centres can be separated from the set of points by a line) for which we present an .(...)-tim作者: 神經(jīng) 時(shí)間: 2025-3-29 01:21 作者: Assignment 時(shí)間: 2025-3-29 06:22
On Protein Structure Alignment under Distance Constraint, between every two of these points that are sufficiently close. Given two proteins represented this way, our problem is to find a subset of points from each protein, and a bijective matching of points between these two subsets, with the objective of maximizing either (A) the size of the subsets (LCP作者: 變形 時(shí)間: 2025-3-29 10:42 作者: 植物茂盛 時(shí)間: 2025-3-29 13:21 作者: hurricane 時(shí)間: 2025-3-29 18:01
,Fréchet Distance Problems in Weighted Regions,hted length of the line segment joining the points. In the second one, the distance between two points is the length of the shortest path between the points. In both cases we give algorithms for finding a (1?+?.)-factor approximation of the Fréchet distance between two polygonal curves. We also cons作者: 尾隨 時(shí)間: 2025-3-29 22:02 作者: 樂意 時(shí)間: 2025-3-30 00:32 作者: Affection 時(shí)間: 2025-3-30 06:18
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body,or any convex body . in the plane, the average distance from the Fermat-Weber center of . to the points of . is larger than ., where Δ(.) is the diameter of .. This proves a conjecture of Carmi, Har-Peled and Katz. From the other direction, we prove that the same average distance is at most .. The n作者: 黃油沒有 時(shí)間: 2025-3-30 09:34 作者: Ovulation 時(shí)間: 2025-3-30 15:12 作者: GOAT 時(shí)間: 2025-3-30 19:40 作者: NEG 時(shí)間: 2025-3-30 23:43 作者: Strength 時(shí)間: 2025-3-31 04:17 作者: Gleason-score 時(shí)間: 2025-3-31 08:02
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm,e algorithm that finds an exact solution. Combining our line-separable algorithm with techniques from the algorithm of Carmi et al. [4] results in an .(....) time 22-approximate solution to the discrete unit disk cover problem.作者: 痛恨 時(shí)間: 2025-3-31 11:18
Max-Coloring Paths: Tight Bounds and Extensions,g trees. In this paper we consider the problem of max-coloring paths and its generalization, max-coloring a broad class of trees and show it can be solved in time .. When vertex weights belong to ?, we show a matching lower bound of Ω(|.|log|.|) in the algebraic computation tree model.作者: 無節(jié)奏 時(shí)間: 2025-3-31 14:29
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body,ew bound substantially improves the previous bound of . due to Abu-Affash and Katz, and brings us closer to the conjectured value of .. We also confirm the upper bound conjecture for centrally symmetric planar convex bodies.作者: aerobic 時(shí)間: 2025-3-31 17:56 作者: Affable 時(shí)間: 2025-4-1 00:30 作者: Prosaic 時(shí)間: 2025-4-1 02:08
Das Verbraucherschutzstrafrechtxponential). Therefore, the cast puzzle problem of size .-exponential is .-EXPSPACE-hard for every integer .?≥?0. We also present a polynomial-time transformation from an arbitrary instance?. of the SAT problem to a cast puzzle?.. such that . is satisfiable if and only if .. is solvable.作者: 柳樹；枯黃 時(shí)間: 2025-4-1 06:31 作者: –scent 時(shí)間: 2025-4-1 12:57
https://doi.org/10.1007/978-3-662-26420-1and space. Then the algorithm constructs each stereoisomer by backtracking the process of computing the numbers of stereoisomers in .(.) space and in .(.) time per stereoisomer. The latter result is achieved by a fast bijection algorithm for combinations of distinct integers.作者: 宿醉 時(shí)間: 2025-4-1 16:42
Der Mathematikunterricht in der Primarstufeed to find a (1?+?.)-approximate solution to 2-dimensional fractional bin packing, the LP relaxation of the popular set covering formulation of 2-dimensional bin packing, which is the key to the practical solution of the problem.作者: 細(xì)菌等 時(shí)間: 2025-4-1 20:43 作者: 膠水 時(shí)間: 2025-4-2 00:12
