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 –- ESA 2012 [[electronic resource] ] : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings / / edited by Leah Epstein, Paolo Ferragina
| Algorithms –- ESA 2012 [[electronic resource] ] : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings / / edited by Leah Epstein, Paolo Ferragina |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XX, 839 p. 147 illus.) |
| Disciplina | 005.7/3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer networks Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Artificial intelligence—Data processing Computer Communication Networks Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis Data Science |
| ISBN | 3-642-33090-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithm engineering -- algorithmic aspects of networks -- algorithmic game theory -- approximation algorithms -- computational biology -- computational finance -- computational geometry -- combinatorial optimization -- data compression -- data structures.-databases and information retrieval -- distributed and parallel computing -- graph algorithms -- hierarchical memories -- heuristics and meta-heuristics -- mathematical programming -- mobile computing -- on-line algorithms -- parameterized complexity -- pattern matching, quantum computing -- randomized algorithms -- scheduling and resource allocation problems -- streaming algorithms. |
| Record Nr. | UNISA-996465557503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers / / edited by Leah Epstein, Thomas Erlebach
| Approximation and Online Algorithms [[electronic resource] ] : 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers / / edited by Leah Epstein, Thomas Erlebach |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 349 p. 39 illus., 22 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical analysis Computer engineering Computer networks Discrete Mathematics in Computer Science Data Science Numerical Analysis Computer Engineering and Networks |
| ISBN | 3-030-04693-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Some Easy and Some Not So Easy Geometric Optimization Problems -- Deterministic Min-Cost Matching with Delays -- Sequential Metric Dimension -- A Primal-Dual Online Deterministic Algorithm for Matching with Delays -- Advice Complexity of Priority Algorithms -- Approximating Node-Weighted k-MST on Planar Graphs -- Exploring Sparse Graphs with Advice -- Call Admission Problems on Grids with Advice -- Improved Approximation Algorithms for Minimum Power Covering Problems -- DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals -- Strategic Contention Resolution in Multiple Channels -- Sublinear Graph Augmentation for Fast Query Implementation -- Bin Packing Games with Weight Decision: How To Get a Small Value for the Price of Anarchy -- Probabilistic Embeddings of the Fréchet Distance -- Algorithms for Dynamic NFV Workload -- Longest Increasing Subsequence under Persistent Comparison Errors -- Cut Sparsifiers for Balanced Digraphs -- Reconfiguration of Graphs with Connectivity Constraints -- The Itinerant List Update Problem -- The Price of Fixed Assignments in Stochastic Extensible Bin Packing. |
| Record Nr. | UNISA-996466188003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms : 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers / / edited by Leah Epstein, Thomas Erlebach
| Approximation and Online Algorithms : 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers / / edited by Leah Epstein, Thomas Erlebach |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 349 p. 39 illus., 22 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science - Mathematics Discrete mathematics Artificial intelligence - Data processing Numerical analysis Computer engineering Computer networks Discrete Mathematics in Computer Science Data Science Numerical Analysis Computer Engineering and Networks |
| ISBN |
9783030046934
3030046931 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Some Easy and Some Not So Easy Geometric Optimization Problems -- Deterministic Min-Cost Matching with Delays -- Sequential Metric Dimension -- A Primal-Dual Online Deterministic Algorithm for Matching with Delays -- Advice Complexity of Priority Algorithms -- Approximating Node-Weighted k-MST on Planar Graphs -- Exploring Sparse Graphs with Advice -- Call Admission Problems on Grids with Advice -- Improved Approximation Algorithms for Minimum Power Covering Problems -- DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals -- Strategic Contention Resolution in Multiple Channels -- Sublinear Graph Augmentation for Fast Query Implementation -- Bin Packing Games with Weight Decision: How To Get a Small Value for the Price of Anarchy -- Probabilistic Embeddings of the Fréchet Distance -- Algorithms for Dynamic NFV Workload -- Longest Increasing Subsequence under Persistent Comparison Errors -- Cut Sparsifiers for Balanced Digraphs -- Reconfigurationof Graphs with Connectivity Constraints -- The Itinerant List Update Problem -- The Price of Fixed Assignments in Stochastic Extensible Bin Packing. |
| Record Nr. | UNINA-9910349389403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||