Algorithms and complexity : 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003 : proceedings
Gardado en:
| Autor Corporativo: | |
|---|---|
| Outros autores: | , , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science
2653 |
| Sujets: | |
| Acceso en liña: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithms and complexity, 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003, proceedings, Rossella Petreschi, Giuseppe Persiano, Riccardo Silvestri (eds.), Berlin, Springer, 2003, 1 vol. (XI-288 p.), Lecture notes in computer science, 3-540-40176-8 • Algorithms and Complexity, Texte imprimé, 9783662196328 |
Table des matières:
- 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 toRailway Stations
- Differential Approximation for Some Routing Problems.