Algorithms and Complexity [[electronic resource] ] : 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings / / by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri

• Autore: Petreschi Rosella
• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003
• Edizione: 1st ed. 2003.
• Descrizione fisica: 1 online resource (X, 290 p.)
• Disciplina: 511/.8
• Soggetto topico: Mathematical logic; Algorithms; Data structures (Computer science); Computers; Computer science—Mathematics; Computer graphics; Mathematical Logic and Foundations; Algorithm Analysis and Problem Complexity; Data Structures; Computation by Abstract Devices; Discrete Mathematics in Computer Science; Computer Graphics
• Persona (resp. second.): PersianoGiuseppe; SilvestriRiccardo
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: 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.
• Titolo autorizzato: Algorithms and Complexity
• ISBN: 3-540-44849-7
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996465703903316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 2653