標(biāo)題: Titlebook: Algorithms and Complexity; 4th Italian Conferen Giancarlo Bongiovanni,Rossella Petreschi,Giorgio G Conference proceedings 2000 Springer-Ver [打印本頁(yè)] 作者: 不能平庸 時(shí)間: 2025-3-21 19:44
書(shū)目名稱Algorithms and Complexity影響因子(影響力)
書(shū)目名稱Algorithms and Complexity影響因子(影響力)學(xué)科排名
書(shū)目名稱Algorithms and Complexity網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Algorithms and Complexity網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Algorithms and Complexity被引頻次
書(shū)目名稱Algorithms and Complexity被引頻次學(xué)科排名
書(shū)目名稱Algorithms and Complexity年度引用
書(shū)目名稱Algorithms and Complexity年度引用學(xué)科排名
書(shū)目名稱Algorithms and Complexity讀者反饋
書(shū)目名稱Algorithms and Complexity讀者反饋學(xué)科排名
作者: output 時(shí)間: 2025-3-21 21:21 作者: nephritis 時(shí)間: 2025-3-22 04:05
Algorithms for a Simple Point Placement Problemen many pairs of them, estimate the relative positions of the points. Problems of this flavor arise in a variety of contexts. The particular motivating example that inspired this work comes from molecular biology; the points are markers on a chromosome and the goal is to map their positions. The pro作者: Fsh238 時(shí)間: 2025-3-22 06:06 作者: CUB 時(shí)間: 2025-3-22 10:18
Online Strategies for Backupsaults are rare, i.e. the cost of work between two faults is typically large compared to the cost of one backup. Instead of the (worst- case) competitive ratio we use a refined and more expressive quality measure, in terms of the average fault frequency. This is not standard in the online algorithm l作者: invade 時(shí)間: 2025-3-22 16:49 作者: beta-cells 時(shí)間: 2025-3-22 20:16 作者: 鄙視 時(shí)間: 2025-3-23 00:46
The Hardness of Placing Street Names in a Manhattan Type Mapof maps from a growing and altering set of data. We will show that the problem of placing street names without conflicts in a rectangular grid of streets is NP-complete and APX-hard. This is the first result of this type in this area. Further importance of this result arises from the fact that the c作者: 阻塞 時(shí)間: 2025-3-23 03:55 作者: deceive 時(shí)間: 2025-3-23 07:21 作者: Defraud 時(shí)間: 2025-3-23 10:48
The Online-TSP against Fair Adversariesalesman moves at no more than unit speed and starts and ends his work at a designated origin. The objective is to find a routing for the salesman which finishes as early as possible..We consider the online traveling salesman problem when restricted to the non-negative part of the real line. We show 作者: 吞吞吐吐 時(shí)間: 2025-3-23 17:06 作者: 放縱 時(shí)間: 2025-3-23 21:50
Triangulations without Minimum-Weight Drawing triangulation, Delaunay triangulation, etc.. Lenhart and Liotta [.] in their pioneering paper on “drawable” minimum-weight triangulations raised an open problem: ‘Does every triangulation graph whose skeleton is a forest admit a minimum-weight drawing?’ In this paper, we answer this problem by disp作者: 縮影 時(shí)間: 2025-3-23 23:33
Faster Exact Solutions for M,2S,cision version, we are given an additional parameter . and the question is whether we can simultaneously satisfy at least . clauses. This problem is .-complete. We improve on known upper bounds on the worst case running time of M.2S., implying also new upper bounds for Maximum Cut. In particular, we作者: BAIL 時(shí)間: 2025-3-24 02:51
Dynamically Maintaining the Widest ,-Dense Corridorze .(..), where . is the num- ber of points present on the floor at the current instant of time. For each insertion/deletion of points, the data structure can be updated in . time, and the widest .-dense corridor in the updated environment can be reported in .(. + .log.) time.作者: rheumatism 時(shí)間: 2025-3-24 10:09 作者: corpuscle 時(shí)間: 2025-3-24 12:48 作者: 珠寶 時(shí)間: 2025-3-24 15:59
QuickHeapsort, an Efficient Mix of Classical Sorting Algorithmsg .) in the length . of the input. More specifically, the algorithm performs . log . + 3. comparisons and . log . + 2.65. element moves on the average..An experimental comparison of our proposed algorithm with the most efficient variants of Quicksort and Heapsort is carried out and its results are discussed.作者: 裂縫 時(shí)間: 2025-3-24 22:53 作者: Presbycusis 時(shí)間: 2025-3-25 00:26 作者: 壟斷 時(shí)間: 2025-3-25 06:22 作者: 縱火 時(shí)間: 2025-3-25 08:05 作者: Cytology 時(shí)間: 2025-3-25 13:04
,Klimafreundlich leben – So geht’s!,ze .(..), where . is the num- ber of points present on the floor at the current instant of time. For each insertion/deletion of points, the data structure can be updated in . time, and the widest .-dense corridor in the updated environment can be reported in .(. + .log.) time.作者: 征兵 時(shí)間: 2025-3-25 19:25
Ethik in Zeiten des Klimawandelsrray it returns, with high probability, a very close estimate of the true median. The running time is linear in the length . of the input. The algorithm performs fewer than .comparisons and .exchanges on the average. We present analytical results of the performance of the algorithm, as well as experimental illustrations of its precision.作者: Banister 時(shí)間: 2025-3-25 23:38
https://doi.org/10.1007/978-3-531-90753-6It is proved, sharpening previous results of Scheinerman and by analysing an algorithm, that the independence number of the random interval graph, defined as the intersection graph of . intervals whose end points are chosen at random on [0,1], concentrates around ..作者: 發(fā)展 時(shí)間: 2025-3-26 00:45
Der Klimaschutzdiskurs der ?Neuen Rechten“We consider a new method to retrieve keys in a static table. The keys of the table are stored in such a way that a binary search can be performed more efficently. An analysis of the method is performed and empirical evidence is given that it actually works.作者: 可卡 時(shí)間: 2025-3-26 07:21
The Independence Number of Random Interval GraphsIt is proved, sharpening previous results of Scheinerman and by analysing an algorithm, that the independence number of the random interval graph, defined as the intersection graph of . intervals whose end points are chosen at random on [0,1], concentrates around ..作者: PON 時(shí)間: 2025-3-26 08:31
Modified Binary Searching for Static TablesWe consider a new method to retrieve keys in a static table. The keys of the table are stored in such a way that a binary search can be performed more efficently. An analysis of the method is performed and empirical evidence is given that it actually works.作者: Fissure 時(shí)間: 2025-3-26 14:26
Der Kindergarten als Bildungsinstitution computer science and operations research and one for which an impressive amount of algorithms (in particular heuristics and approximation algorithms) have been proposed. While in the general case the problem is known not to allow any constant ratio approximation algorithm and in the metric case no 作者: 煉油廠 時(shí)間: 2025-3-26 19:35 作者: Bouquet 時(shí)間: 2025-3-26 22:42
Der Kindergarten als Bildungsinstitutionen many pairs of them, estimate the relative positions of the points. Problems of this flavor arise in a variety of contexts. The particular motivating example that inspired this work comes from molecular biology; the points are markers on a chromosome and the goal is to map their positions. The pro作者: 頌揚(yáng)國(guó)家 時(shí)間: 2025-3-27 03:10
Der Kindergarten als Bildungsinstitutionhain network, in which one constructs a set of paths, that enable connecting one vertex with all others in the network. We consider the parameters of load (the maximum number of paths that go through any single edge) and hop count (the maximum number of paths traversed by any single message). Optima作者: 使長(zhǎng)胖 時(shí)間: 2025-3-27 07:10
https://doi.org/10.1007/978-3-531-90753-6aults are rare, i.e. the cost of work between two faults is typically large compared to the cost of one backup. Instead of the (worst- case) competitive ratio we use a refined and more expressive quality measure, in terms of the average fault frequency. This is not standard in the online algorithm l作者: 敵手 時(shí)間: 2025-3-27 11:28
https://doi.org/10.1007/978-3-531-90753-6 of current algorithm and complexity theory. The aim of this paper is twofold. First, we introduce the notion of stability of approximation algorithms. This notion is shown to be of practical as well as of theoretical importance, especially for the real understanding of the applicability of approxim作者: 自作多情 時(shí)間: 2025-3-27 13:49 作者: adumbrate 時(shí)間: 2025-3-27 20:42 作者: apropos 時(shí)間: 2025-3-28 01:20 作者: cunning 時(shí)間: 2025-3-28 04:58
https://doi.org/10.1007/978-3-322-95530-2king, a set of requests for the online dial-a-ride problem is reasonable if the requests that come up in a sufficiently large time period can be served in a time period of at most the same length. This new notion is a stability criterion implying that the system is not overloaded. The new concept is作者: 單色 時(shí)間: 2025-3-28 06:18 作者: 過(guò)剩 時(shí)間: 2025-3-28 12:42 作者: Abominate 時(shí)間: 2025-3-28 18:37
https://doi.org/10.1007/978-3-642-66770-1 triangulation, Delaunay triangulation, etc.. Lenhart and Liotta [.] in their pioneering paper on “drawable” minimum-weight triangulations raised an open problem: ‘Does every triangulation graph whose skeleton is a forest admit a minimum-weight drawing?’ In this paper, we answer this problem by disp作者: CANE 時(shí)間: 2025-3-28 22:20
,Wohnen – Was macht (m)ein Haus klimafit ?,cision version, we are given an additional parameter . and the question is whether we can simultaneously satisfy at least . clauses. This problem is .-complete. We improve on known upper bounds on the worst case running time of M.2S., implying also new upper bounds for Maximum Cut. In particular, we作者: browbeat 時(shí)間: 2025-3-29 00:43 作者: exhilaration 時(shí)間: 2025-3-29 05:40
Der Klimaschutzdiskurs der ?Neuen Rechten“directions is greater than two. In this paper, we consider an interesting subclass of discrete sets having some connectivity and convexity properties and we provide a polynomial-time algorithm for reconstructing a discrete set of this class from its X-rays in directions (1, 0), (0, 1) and (1, 1). Th作者: OPINE 時(shí)間: 2025-3-29 11:16 作者: Generic-Drug 時(shí)間: 2025-3-29 14:03 作者: 潛移默化 時(shí)間: 2025-3-29 19:17
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153113.jpg作者: 委屈 時(shí)間: 2025-3-29 21:17 作者: Armory 時(shí)間: 2025-3-30 02:47
978-3-540-67159-6Springer-Verlag Berlin Heidelberg 2000作者: Admire 時(shí)間: 2025-3-30 05:29
Conference proceedings 2000Narsingh Deo, Walter Ruzzo, and Shmuel Zaks to give plenary lectures at the conference. We wish to express our appreciation to all the authors of the submitted papers, to the program committee members and the referees, to the organizing committee, and to the plenary lecturers who accepted our invita作者: 革新 時(shí)間: 2025-3-30 09:43
Der Kindergarten als Bildungsinstitutionimimize the average time incurred by the customers to be served rather than to mini- mize its working time like the egoistic Travelling Salesman does. The new approximation scheme for the Travelling Salesman is also at the basis of a new approximation scheme for the Travelling Repairman problem in t作者: 迅速飛過(guò) 時(shí)間: 2025-3-30 13:11 作者: 宿醉 時(shí)間: 2025-3-30 19:12 作者: Servile 時(shí)間: 2025-3-30 23:44 作者: Dorsal-Kyphosis 時(shí)間: 2025-3-31 04:15 作者: Efflorescent 時(shí)間: 2025-3-31 07:13 作者: 賠償 時(shí)間: 2025-3-31 09:16
Duality in ATM Layout Problemsaths layouts we use binary trees and lattice paths (that use horizontal and vertical steps). In the general case we use ternary trees, lattice paths (that use horizontal, vertical and diagonal steps), and high dimensional spheres. These correspondences shed light on the structure of the optimal solu作者: LAST 時(shí)間: 2025-3-31 14:30
The Online-TSP against Fair Adversarieshan against a conventional adversary. Specifically, we present an algorithm against a fair adversary with competitive ratio .and provide a matching lower bound. We also show competitiveness results for a special class of algorithms (called diligent algorithms) that do not allow waiting time for the 作者: gout109 時(shí)間: 2025-3-31 20:58 作者: Malleable 時(shí)間: 2025-4-1 01:06 作者: 貪心 時(shí)間: 2025-4-1 05:41 作者: patriarch 時(shí)間: 2025-4-1 07:18
