Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms and Complexity [[electronic resource] ] : 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings / / edited by Tiziana Calamoneri, Irene Finocchi, Guiseppe F. Italiano
| Algorithms and Complexity [[electronic resource] ] : 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings / / edited by Tiziana Calamoneri, Irene Finocchi, Guiseppe F. Italiano |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XII, 396 p.) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Computer science Computer science—Mathematics Discrete mathematics Computer graphics Data Science Theory of Computation Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-34378-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Reliable and Efficient Geometric Computing -- Beware of the Model: Reflections on Algorithmic Research -- On Search Problems in Complexity Theory and in Logic (Abstract) -- Session 1 -- Covering a Set of Points with a Minimum Number of Lines -- Approximation Algorithms for Capacitated Rectangle Stabbing -- In-Place Randomized Slope Selection -- Session 2 -- Quadratic Programming and Combinatorial Minimum Weight Product Problems -- Counting All Solutions of Minimum Weight Exact Satisfiability -- Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms -- Session 3 -- Network Discovery and Verification with Distance Queries -- Deciding the FIFO Stability of Networks in Polynomial Time -- Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates -- Session 4 -- Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups -- Gathering Algorithms on Paths Under Interference Constraints -- On the Hardness of Range Assignment Problems -- Session 5 -- Black Hole Search in Asynchronous Rings Using Tokens -- On Broadcast Scheduling with Limited Energy -- A Near Optimal Scheduler for On-Demand Data Broadcasts -- Session 6 -- Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines -- Tighter Approximation Bounds for LPT Scheduling in Two Special Cases -- Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations -- Session 7 -- Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems -- An Approximation Algorithm for a Bottleneck Traveling Salesman Problem -- On the Minimum Common Integer Partition Problem -- Session 8 -- Matching Subsequences in Trees -- Distance Approximating Trees: Complexity and Algorithms -- How to Pack Directed Acyclic Graphs into Small Blocks -- Session 9 -- On-Line Coloring of H-Free Bipartite Graphs -- Distributed Approximation Algorithms for Planar Graphs -- A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small -- Session 10 -- Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments -- Parameterized Algorithms for Hitting Set: The Weighted Case -- Fixed-Parameter Tractable Generalizations of Cluster Editing -- Session 11 -- The Linear Arrangement Problem Parameterized Above Guaranteed Value -- Universal Relations and #P-Completeness -- Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. |
| Record Nr. | UNISA-996465902403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings / / edited by Luis Caires, Guiseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi, Moti Yung
| Automata, Languages and Programming [[electronic resource] ] : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings / / edited by Luis Caires, Guiseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi, Moti Yung |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (L, 1482 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Mathematical logic Software engineering Data structures (Computer science) Information theory Artificial intelligence—Data processing Computer Science Mathematical Logic and Foundations Theory of Computation Software Engineering Data Structures and Information Theory Data Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Data Structures I -- Cryptography and Complexity -- Data Structures II -- Cryptography and Distributed Systems -- Graph Algorithms I -- Security Mechanisms -- Graph Algorithms II -- Automata and Formal Languages I -- Signature and Message Authentication -- Algorithmic Game Theory -- Automata and Logic -- Computational Algebra -- Cache-Oblivious Algorithms and Algorithmic Engineering -- On-line Algorithms -- Security Protocols Logic -- Random Graphs -- Concurrency I -- Encryption and related Primitives -- Approximation Algorithms I -- Games -- Approximation Algorithms II -- Lower Bounds -- Probability -- Approximation Algorithms III -- Automata and Formal Languages II -- Approximation Algorithms IV -- Algebraic Computation and Communication Complexity -- Concurrency II -- String Matching and Computational Biology -- Quantum Complexity -- Analysis and Verification -- Geometry and Load Balancing -- Concrete Complexity and Codes -- Model Theory and Model Checking. |
| Record Nr. | UNISA-996465830303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||