標(biāo)題: Titlebook: Algorithms and Computation; 15th International S Rudolf Fleischer,Gerhard Trippen Conference proceedings 2005 Springer-Verlag Berlin Heidel [打印本頁] 作者: Truman 時(shí)間: 2025-3-21 19:06
書目名稱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 20:47
Pareto Optimality in House Allocation Problems,or finding a maximum cardinality Pareto optimal matching, where . is the number of agents and . is the total length of the preference lists. By contrast, we show that the problem of finding a minimum cardinality Pareto optimal matching is NP-hard, though approximable within a factor of 2. We then sh作者: Countermand 時(shí)間: 2025-3-22 04:12
Property-Preserving Data Reconstruction,t of sorted numbers, or points on a manifold, or vectors in a polyhedral cone, or codewords from an error-correcting code. Because of noise and errors, however, an (unknown) fraction of the data is deemed ., ie, in violation with the expected structural properties. Can one still query into the datas作者: 刺耳 時(shí)間: 2025-3-22 07:00 作者: Indent 時(shí)間: 2025-3-22 09:47 作者: Ablation 時(shí)間: 2025-3-22 16:23 作者: 牢騷 時(shí)間: 2025-3-22 20:40
Multicriteria Global Minimum Cuts, has?. non-negative costs associated with it. These costs are measured in separate, non interchangeable, units. In the AND-version of the problem, purchasing an edge requires the payment of . the?. costs associated with it. In the OR-version, an edge can be purchased by paying . of the .-costs assoc作者: 背景 時(shí)間: 2025-3-23 00:48
Polyline Fitting of Planar Points Under Min-sum Criteria,tting a polyline with . joints under the min-sum criteria with respect to . .- and . .-metrics, which are more appropriate measures than uniform and Hausdorff metrics in statistical context. We present efficient algorithms for the 1-joint versions of the problem, and fully polynomial-time approximat作者: Cardioversion 時(shí)間: 2025-3-23 02:10
A Generalization of Magic Squares with Applications to Digital Halftoning,eneralize this notion to that of a . . . by replacing the requirement that the sum of each row and each column be the same by that of requiring that the sum of the entries in each . × . square contiguous submatrix be the same. We show that such matrices exist if . and . are both even, and do not if 作者: PATHY 時(shí)間: 2025-3-23 07:37
Voronoi Diagrams with a Transportation Network on the Euclidean Plane,portation network, the distance is measured as the length of the shortest (time) path. In doing so, we introduce a needle, a generalized Voronoi site. We present an .(. .log . + . .log .) algorithm to compute the Voronoi diagram with a transportation network on the Euclidean plane, where . is the nu作者: 騷動 時(shí)間: 2025-3-23 12:30 作者: corpuscle 時(shí)間: 2025-3-23 15:39
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation,died suitable approximation preserving reductions. Next, we devise new approximation preserving reductions, called?. and?., respectively, and prove that, under these reductions, natural problems are .-complete, always for both standard and differential approximation paradigms. To our knowledge, no n作者: 揮舞 時(shí)間: 2025-3-23 20:34 作者: Esalate 時(shí)間: 2025-3-24 02:08 作者: Rinne-Test 時(shí)間: 2025-3-24 05:25 作者: DRILL 時(shí)間: 2025-3-24 08:30 作者: 惰性女人 時(shí)間: 2025-3-24 13:31 作者: Sigmoidoscopy 時(shí)間: 2025-3-24 16:50 作者: SEMI 時(shí)間: 2025-3-24 20:28
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153133.jpg作者: 免費(fèi) 時(shí)間: 2025-3-24 23:45
https://doi.org/10.1007/b104582Partition; algorithmics; algorithms; approximation; combinatorial optimization; combinatorics; complexity; 作者: Dappled 時(shí)間: 2025-3-25 03:37
978-3-540-24131-7Springer-Verlag Berlin Heidelberg 2005作者: Projection 時(shí)間: 2025-3-25 11:33
https://doi.org/10.1007/978-3-322-92343-1Solving and designing puzzles, creating sculpture and architecture, and inventing magic tricks all lead to fun and interesting algorithmic problems. This talk describes some of our explorations into these areas.作者: 范例 時(shí)間: 2025-3-25 14:52 作者: 情感 時(shí)間: 2025-3-25 17:36
Algorithms and Computation978-3-540-30551-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Protein 時(shí)間: 2025-3-25 20:07
Der Markt für Flugtickets in Europaet . be a graph on . with . edges of non-negative weight. The union of the two graphs is denoted .. We present a data structure of size . that answers (1+.)-approximate shortest path queries in . in constant time, where .>?0 is constant.作者: Credence 時(shí)間: 2025-3-26 03:07
Managementwissen im Wandel: Reflexion,tting a polyline with . joints under the min-sum criteria with respect to . .- and . .-metrics, which are more appropriate measures than uniform and Hausdorff metrics in statistical context. We present efficient algorithms for the 1-joint versions of the problem, and fully polynomial-time approximation schemes for the general .-joint versions.作者: 蕨類 時(shí)間: 2025-3-26 04:47
https://doi.org/10.1007/978-3-531-93295-8 space into . convex cells according which site is closest. The Voronoi diagram and its dual, the Delaunay triangulation are among the most fundamental proximity structures known, and have numerous uses in science. For example, applying point location to the subdivision defined by a Voronoi diagram 作者: Anemia 時(shí)間: 2025-3-26 10:29 作者: Slit-Lamp 時(shí)間: 2025-3-26 14:49
https://doi.org/10.1007/978-3-322-90286-3t of sorted numbers, or points on a manifold, or vectors in a polyhedral cone, or codewords from an error-correcting code. Because of noise and errors, however, an (unknown) fraction of the data is deemed ., ie, in violation with the expected structural properties. Can one still query into the datas作者: anaerobic 時(shí)間: 2025-3-26 18:57 作者: Contracture 時(shí)間: 2025-3-26 22:02 作者: 擴(kuò)音器 時(shí)間: 2025-3-27 01:27
Der Markt für Flugtickets in Europaet . be a graph on . with . edges of non-negative weight. The union of the two graphs is denoted .. We present a data structure of size . that answers (1+.)-approximate shortest path queries in . in constant time, where .>?0 is constant.作者: FICE 時(shí)間: 2025-3-27 05:58 作者: Ovulation 時(shí)間: 2025-3-27 11:16 作者: Highbrow 時(shí)間: 2025-3-27 16:19
Definition von Personaldienstleistungen,eneralize this notion to that of a . . . by replacing the requirement that the sum of each row and each column be the same by that of requiring that the sum of the entries in each . × . square contiguous submatrix be the same. We show that such matrices exist if . and . are both even, and do not if 作者: ligature 時(shí)間: 2025-3-27 20:48 作者: 沙漠 時(shí)間: 2025-3-27 21:55
https://doi.org/10.1007/978-3-531-91527-2different homologous RNA molecules it is usually not sufficient to consider only the primary sequence, but it is important to consider both the sequence and the structure of the molecules. Traditional alignment algorithms can only account for the sequence of bases, but not for the base pairings. Con作者: Exonerate 時(shí)間: 2025-3-28 02:34
https://doi.org/10.1007/978-3-531-91527-2died suitable approximation preserving reductions. Next, we devise new approximation preserving reductions, called?. and?., respectively, and prove that, under these reductions, natural problems are .-complete, always for both standard and differential approximation paradigms. To our knowledge, no n作者: Metastasis 時(shí)間: 2025-3-28 08:30
Der Marktproze? an Aktienb?rsen problem involves finding the . largest values of . for 1 ≤ . ≤ . ≤ .. The problem for fixed . = 1, also known as the maximum sum subsequence problem, has received much attention in the literature and is linear-time solvable. Recently, Bae and Takaoka presented a Θ(.)-time algorithm for the . maximu作者: 輕觸 時(shí)間: 2025-3-28 10:52
neue betriebswirtschaftliche forschung (nbf)rány and Matou?ek [3]. The contribution of this paper is two-fold. (i) We prove the existence of an infinite set of equitable 2-fans. (ii) We present an efficient algorithm for finding an equitable 2-fan when the mass distributions are discrete, i.e. finite sets of points. Both (i) and (ii) can be e作者: Daily-Value 時(shí)間: 2025-3-28 17:25 作者: 昏暗 時(shí)間: 2025-3-28 22:10
Marktwert und Risikomanagement, communications and the overall transmission cost is divided among the receivers according to given cost sharing methods. Receivers enjoy a benefit equal to the difference between the utility they get from the transmission and the shared cost they are asked to pay. Assuming a selfish and rational be作者: 爆米花 時(shí)間: 2025-3-28 23:18 作者: debris 時(shí)間: 2025-3-29 04:15 作者: Angiogenesis 時(shí)間: 2025-3-29 08:49
Approximate Distance Oracles for Graphs with Dense Clusters,et . be a graph on . with . edges of non-negative weight. The union of the two graphs is denoted .. We present a data structure of size . that answers (1+.)-approximate shortest path queries in . in constant time, where .>?0 is constant.作者: Phenothiazines 時(shí)間: 2025-3-29 12:44
Polyline Fitting of Planar Points Under Min-sum Criteria,tting a polyline with . joints under the min-sum criteria with respect to . .- and . .-metrics, which are more appropriate measures than uniform and Hausdorff metrics in statistical context. We present efficient algorithms for the 1-joint versions of the problem, and fully polynomial-time approximation schemes for the general .-joint versions.作者: embolus 時(shí)間: 2025-3-29 15:50
https://doi.org/10.1007/978-3-531-93295-8higher dimensions. First, the combinatorial complexity of the diagram grows rapidly, as fast as Ω(. .) in .-dimensional space. Second, the diagram does not admit a straightforward search structure in higher dimensions.作者: 絕食 時(shí)間: 2025-3-29 20:20 作者: 變白 時(shí)間: 2025-3-30 00:33 作者: 事物的方面 時(shí)間: 2025-3-30 04:45 作者: 不易燃 時(shí)間: 2025-3-30 11:08
Der Marktproze? an Aktienb?rsenptimal for . ≥ . log. . and improves over the previously best known result for any value of the user-defined parameter .. Moreover, our results are also extended to the multi-dimensional versions of the . maximum sum subsequences problem; resulting in fast algorithms as well.作者: CHIP 時(shí)間: 2025-3-30 14:14
https://doi.org/10.1007/978-3-322-99377-9 height and the maximum degree of ., respectively. A faster version of our algorithm can be used for 2-edge connecting a spider tree, that is a tree with at most one vertex of degree greater than two. This finds application in strengthening the reliability of optical networks.作者: NAIVE 時(shí)間: 2025-3-30 19:38
Der Markup als ?konomische Kennzahler we introduce the concept of . by relaxation of equitable partitions, thus providing a theoretical foundation for similarity measures which enjoys desirable properties with respect to existence, structure, and tractability.作者: 使成波狀 時(shí)間: 2025-3-31 00:18
https://doi.org/10.1007/978-3-658-38272-8 with the same topology on a given set of points. We show that this polygon can be constructed, for a given point set and given topology, in linear time. We discuss some of the future applications of this polygon, which can be thought of as a geometric representation of the amount of flexibility inherent in a given .-SMT.作者: debble 時(shí)間: 2025-3-31 04:34 作者: 使糾纏 時(shí)間: 2025-3-31 08:25 作者: 辯論 時(shí)間: 2025-3-31 09:29 作者: 苦澀 時(shí)間: 2025-3-31 16:16
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation,s under .- and?.-reductions and we show that such problems exist provided that there exist .-intermediate problems under Turing-reduction. Finally, we show that . is .-complete for the differential approximation.作者: 出價(jià) 時(shí)間: 2025-3-31 18:02
Efficient Algorithms for , Maximum Sums,ptimal for . ≥ . log. . and improves over the previously best known result for any value of the user-defined parameter .. Moreover, our results are also extended to the multi-dimensional versions of the . maximum sum subsequences problem; resulting in fast algorithms as well.作者: 我沒有強(qiáng)迫 時(shí)間: 2025-3-31 23:38 作者: ANT 時(shí)間: 2025-4-1 02:30 作者: 沙文主義 時(shí)間: 2025-4-1 07:03 作者: faculty 時(shí)間: 2025-4-1 12:31
https://doi.org/10.1007/978-3-322-81963-5olynomial for any fixed number?. of criteria. The OR-version of the problem, on the other hand, is NP-hard even for .=2, but can be solved in pseudo-polynomial time for any fixed number?. of criteria. It also admits an FPTAS. Further extensions, some applications, and multicriteria versions of two other optimization problems are also discussed.作者: burnish 時(shí)間: 2025-4-1 16:17
https://doi.org/10.1007/978-3-531-91527-2doknots). We phrase the problem as an integer linear program and then solve it using Lagrangian relaxation. In our computational experiments we could align large problem instances—18S and 23S ribosomal RNA with up to 1500 bases within minutes while preserving pseudoknots.作者: neuron 時(shí)間: 2025-4-1 21:09
Multicriteria Global Minimum Cuts,olynomial for any fixed number?. of criteria. The OR-version of the problem, on the other hand, is NP-hard even for .=2, but can be solved in pseudo-polynomial time for any fixed number?. of criteria. It also admits an FPTAS. Further extensions, some applications, and multicriteria versions of two other optimization problems are also discussed.作者: 你不公正 時(shí)間: 2025-4-1 23:26 作者: 小蟲 時(shí)間: 2025-4-2 05:02
0302-9743 g, 20–22 December, 2004. In the past, it has been held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), Vancouver (2002), and Kyoto (2003). ISAAC is an an作者: progestin 時(shí)間: 2025-4-2 07:05
Nachfrage nach Personaldienstleistungen, We present an .(. .log . + . .log .) algorithm to compute the Voronoi diagram with a transportation network on the Euclidean plane, where . is the number of given sites and . is the complexity of the given transportation network.作者: 可能性 時(shí)間: 2025-4-2 15:10
neue betriebswirtschaftliche forschung (nbf)an efficient algorithm for finding an equitable 2-fan when the mass distributions are discrete, i.e. finite sets of points. Both (i) and (ii) can be easily extended to mass distributions in the plane instead of the sphere.作者: CLIFF 時(shí)間: 2025-4-2 16:48 作者: Neutral-Spine 時(shí)間: 2025-4-2 20:53
Equipartitions of Measures by 2-Fans,an efficient algorithm for finding an equitable 2-fan when the mass distributions are discrete, i.e. finite sets of points. Both (i) and (ii) can be easily extended to mass distributions in the plane instead of the sphere.作者: visceral-fat 時(shí)間: 2025-4-3 00:25
https://doi.org/10.1007/978-3-531-93295-8ow that there exist Pareto optimal matchings of all sizes between a minimum and maximum cardinality Pareto optimal matching. Finally, we introduce the concept of a signature, which allows us to give a characterization, checkable in linear time, of instances that admit a unique Pareto optimal matching.作者: 透明 時(shí)間: 2025-4-3 06:45
Conference proceedings 2005ecember, 2004. In the past, it has been held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), Vancouver (2002), and Kyoto (2003). ISAAC is an annual inter作者: adduction 時(shí)間: 2025-4-3 11:20
