Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008347453/catalog> ?p ?o. }

• catalog abstract "The papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference took place on March 1-3, 2000, in Rome (Italy), at the conference center of the University of Rome \La Sapienza". This conference was born in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity, and parallel and distributed computing. Due to a signi cant participation of foreign reaserchers, starting from the second conference, CIAC evolved into an international conference. In response to the call for papers for CIAC 2000, there were 41 subm- sions, from which the program committee selected 21 papers for presentation at the conference. Each paper was evaluated by at least three program committee members. In addition to the selected papers, the organizing committee invited Giorgio Ausiello, Narsingh 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 invitation.".
• catalog contributor b11623954.
• catalog contributor b11623955.
• catalog contributor b11623956.
• catalog contributor b11623957.
• catalog contributor b11623958.
• catalog created "2000.".
• catalog date "2000".
• catalog date "2000.".
• catalog dateCopyrighted "2000.".
• catalog description "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].".
• catalog description "Includes bibliographical references and index.".
• catalog description "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] -- ".
• catalog description "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 -- ".
• catalog description "The papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference took place on March 1-3, 2000, in Rome (Italy), at the conference center of the University of Rome \La Sapienza". This conference was born in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity, and parallel and distributed computing. Due to a signi cant participation of foreign reaserchers, starting from the second conference, CIAC evolved into an international conference. In response to the call for papers for CIAC 2000, there were 41 subm- sions, from which the program committee selected 21 papers for presentation at the conference. Each paper was evaluated by at least three program committee members. In addition to the selected papers, the organizing committee invited Giorgio Ausiello, Narsingh 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 invitation.".
• catalog extent "viii, 315 p. :".
• catalog identifier "3540671595 (softcover)".
• catalog isPartOf "Lecture notes in computer science ; 1767".
• catalog issued "2000".
• catalog issued "2000.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer,".
• catalog subject "511.8 21".
• catalog subject "Algorithms Congresses.".
• catalog subject "Combinatorics.".
• catalog subject "Computational complexity Congresses.".
• catalog subject "Computational complexity.".
• catalog subject "Computer science.".
• catalog subject "Computer software.".
• catalog subject "Data structures (Computer science).".
• catalog subject "QA9.58 .I885 2000".
• catalog tableOfContents "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].".
• catalog tableOfContents "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] -- ".
• catalog tableOfContents "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 -- ".
• catalog title "Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 1-3, 2000 : proceedings / Giancarlo Bongiovanni, Giorgio Gambosi, Rosella Petreschi (eds.).".
• catalog type "Conference proceedings. fast".
• catalog type "Rom (2000) swd".
• catalog type "text".