Algorithms and complexity : 5th Italian conference, CIAC 2003 Rome, Italy, May 28-30, 2003 : proceedings / Rossella Petreschi, Giuseppe Persiano, Riccardo Silvestri (eds.).Material type: TextSeries: Serienbezeichnung | Lecture notes in computer science ; 2653.Publication details: Berlin ; New York : Springer, ©2003. Description: 1 online resource (xi, 288 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540448495; 3540448497Subject(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 (5th : 2003 : Rome, Italy): Algorithms and complexity : 5th Italian conference, CIAC 2003 Rome, Italy, May 28-30, 2003 : proceedingsDDC classification: 511/.8 LOC classification: QA9.58 | .I885 2003Other classification: 54.10 Online resources: Click here to access online
|Item type||Current library||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
This book constitutes the refereed proceedings of the 5th Italian Conference on Algorithms and Computation, CIAC 2003, held in Rome, Italy in May 2003. The 23 revised full papers presented were carefully reviewed and selected from 57 submissions. Among the topics addressed are complexity, complexity theory, geometric computing, matching, online algorithms, combinatorial optimization, computational graph theory, approximation algorithms, network algorithms, routing, and scheduling.
Tutorials -- Localized Network Representations -- Optimal Binary Search Trees with Costs Depending on the Access Paths -- On the Generation of Extensions of a Partially Ordered Set -- Error-Correcting Codes in Complexity Theory -- Invited Talks -- Cache-Oblivious Algorithms -- Spanning Trees with Low Maximum/Average Stretch -- Hyper Encryption and Everlasting Secrets -- Computing with Electronic Nanotechnologies -- Regular Contribution -- Efficient Update Strategies for Geometric Computing with Uncertainty -- Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete -- An Improved Algorithm for Point Set Pattern Matching under Rigid Motion -- Unlocking the Advantages of Dynamic Service Selection and Pricing -- The Relative Worst Order Ratio for On-Line Algorithms -- On-Line Stream Merging, Max Span, and Min Coverage -- Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs -- Additive Spanners for k-Chordal Graphs -- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation -- Reconciling Gene Trees to a Species Tree -- Generating All Forest Extensions of a Partially Ordered Set -- Indexing Structures for Approximate String Matching -- Approximation Hardness for Small Occurrence Instances of NP-Hard Problems -- Fast Approximation of Minimum Multicast Congestion -- Implementation versus Theory -- Approximation of a Retrieval Problem for Parallel Disks -- On k-Edge-Connectivity Problems with Sharpened Triangle Inequality -- The Complexity of Detecting Fixed-Density Clusters -- Nearly Bounded Error Probabilistic Sets -- Some Properties of MODm Circuits Computing Simple Functions -- XOR-Based Schemes for Fast Parallel IP Lookups -- The Impact of Network Structure on the Stability of Greedy Protocols -- Improving Customer Proximity to Railway Stations -- Differential Approximation for Some Routing Problems.