Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 1-3, 2000 : proceedings / Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi (eds.).
Contributor(s): Bongiovanni, Giancarlo | Gambosi, G. (Giorgio) | Petreschi, RossellaMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 1767.Publisher: Berlin ; New York : Springer, ©2000Description: 1 online resource (viii, 315 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540465218; 3540465219Subject(s): Algorithms -- Congresses | Computational complexity -- Congresses | Algorithms | Computational complexity | Complexiteit | Algoritmen | ComputerwiskundeGenre/Form: Electronic books. | Conference papers and proceedings. | Congressen (vorm) Additional physical formats: Print version:Italian Conference on Algorithms and Complexity (4th : 2000 : Rome, Italy): Algorithms and complexityDDC classification: 511.8 LOC classification: QA9.58 | .I885 2000Other classification: 54.10 | SS 4800 | DAT 530f | DAT 517f Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
On salesmen, repairmen, spiders, and other traveling agents / G. Ausiello, S. Leonardi, A. Marchetti-Spaccamela -- Computing a diameter-constrained minimum spanning tree in parallel / N. Deo, A. Abdalla -- Algorithms for a simple point placement problem / J. Redstone, W.L. Ruzzo -- Duality in ATM layout problems / S. Zaks -- The independence number of random interval graphs / W.F. de la Vega -- Online strategies for backups / P. Damaschke -- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem / H.-J. Böckenhauer [and others] -- Semantical counting circuits / F. Noilhan, M. Santha -- The hardness of placing street names in a Manhattan type map / S. Seibert, W. Unger -- Labeling downtown / G. Neyer, F. Wagner -- The online dial-a-ride problem under reasonable load / D. Hauptmeier, S.O. Krumke, J. Rambau -- The online-TSP against fair adversaries / M. Blom [and others] -- QuickHeapsort, an efficient mix of classical sorting algorithms / D. Cantone, G. Cincotti -- Triangulations without minimum-weight drawing / C.A. Wang, F.Y. Chin, B. Yang -- Faster exact solutions for MAX2SAT / J. Gramm, R. Niedermeier -- Dynamically maintaining the widest k-dense corridor / S.C. Nandy, T. Harayama, T. Asano -- Reconstruction of discrete sets from three or more x-rays / E. Barcucci [and others] -- Modified binary searching for static tables / D. Merlini, R. Sprugnoli, M.C. Verri -- An efficient algorithm for the approximate median selection problem / S. Battiato [and others] -- Extending the implicit computational complexity approach to the sub-elementary time-space classes / E. Covino, G. Pani, S. Caporaso -- Group updates for red-black trees / S. Hanke, E. Soisalon-Soininen -- Approximating SVP [infinity symbol] to within almost-polynomial factors is NP-hard / I. Dinur -- Convergence analysis of simulated annealing-based algorithms solving flow shop scheduling problems / K. Steinhöfel, A. Albrecht, C.K. Wong -- On the Lovász number of certain circulant graphs / V.E. Brimkov [and others] -- Speeding up pattern matching by text compression / Y. Shibata [and others].
This book constitutes the refereed proceedings of the 4th Italian Conference on Algorithms and Complexity, CIAC 2000, held in Rome, Italy, in March 2000. The 21 revised full papers presented were carefully reviewed and selected from 41 submissions; also included are four invited survey papers. Among the topics addressed are combinatorial optimization, graph algorithms, graph computations, complexity theory, diagram design, approximation, scheduling, sorting, computational geometry, searching, and pattern matching.