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.
Approximation and Online Algorithms [[electronic resource] ] : 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers / / edited by Christos Kaklamanis, Asaf Levin
| Approximation and Online Algorithms [[electronic resource] ] : 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers / / edited by Christos Kaklamanis, Asaf Levin |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (247 pages) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science - Mathematics Discrete mathematics Data structures (Computer science) Information theory Computer science Application software Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Data Structures and Information Theory Theory of Computation Computer and Information Systems Applications Algorismes en línia Optimització matemàtica |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-80879-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Design and analysis of algorithms -- Online algorithms, approximation algorithms analysis -- Algorithmic game theory and mechanism design -- Parameterized complexity -- Scheduling algorithms -- Competitive analysis. Packing and covering problems -- Rounding techniques. |
| Record Nr. | UNISA-996464413103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis
| Approximation and Online Algorithms [[electronic resource] ] : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (286 pages) |
| Disciplina | 516.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Mathematics - Data processing Computational Mathematics and Numerical Analysis Algorismes en línia Optimització matemàtica |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-92702-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | How to Navigate Through Obstacles -- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle -- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set -- An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity -- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs -- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem -- The Traveling k-Median Problem: Approximating Optimal Network Coverage -- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource -- Several methods of analysis for cardinality constrained bin packing -- Leah Epstein Weighted completion time minimization for capacitated parallel machines -- Server Cloud Scheduling -- FIFO and Randomized Competitive Packet Routing Games -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Analysis of Online Balanced Clustering -- Precedence-Constrained Covering Problems with Multiplicity Constraints -- Contention Resolution, Matrix Scaling and Fair Allocation. |
| Record Nr. | UNISA-996464427803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms : 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers / / edited by Christos Kaklamanis, Asaf Levin
| Approximation and Online Algorithms : 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers / / edited by Christos Kaklamanis, Asaf Levin |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (247 pages) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science - Mathematics Discrete mathematics Data structures (Computer science) Information theory Computer science Application software Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Data Structures and Information Theory Theory of Computation Computer and Information Systems Applications Algorismes en línia Optimització matemàtica |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-80879-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Design and analysis of algorithms -- Online algorithms, approximation algorithms analysis -- Algorithmic game theory and mechanism design -- Parameterized complexity -- Scheduling algorithms -- Competitive analysis. Packing and covering problems -- Rounding techniques. |
| Record Nr. | UNINA-9910490024503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and Online Algorithms : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis
| Approximation and Online Algorithms : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (286 pages) |
| Disciplina | 516.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Mathematics - Data processing Computational Mathematics and Numerical Analysis Algorismes en línia Optimització matemàtica |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-92702-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | How to Navigate Through Obstacles -- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle -- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set -- An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity -- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs -- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem -- The Traveling k-Median Problem: Approximating Optimal Network Coverage -- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource -- Several methods of analysis for cardinality constrained bin packing -- Leah Epstein Weighted completion time minimization for capacitated parallel machines -- Server Cloud Scheduling -- FIFO and Randomized Competitive Packet Routing Games -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Analysis of Online Balanced Clustering -- Precedence-Constrained Covering Problems with Multiplicity Constraints -- Contention Resolution, Matrix Scaling and Fair Allocation. |
| Record Nr. | UNINA-9910520076503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
