top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Approximation and Online Algorithms : 21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023, Proceedings / / Jaroslaw Byrka and Andreas Wiese, editors
Approximation and Online Algorithms : 21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023, Proceedings / / Jaroslaw Byrka and Andreas Wiese, editors
Edizione [First edition.]
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2023]
Descrizione fisica 1 online resource (XII, 236 p. 35 illus., 13 illus. in color.)
Disciplina 518.1
Collana Lecture Notes in Computer Science Series
Soggetto topico Online algorithms
Approximation algorithms
ISBN 3-031-49815-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optimization under Explorable Uncertainty: Adversarial and Stochastic Models -- Approximation Ineffectiveness of a Tour-Untangling Heuristic -- A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities -- Approximating Maximum Edge 2-Coloring by Normalizing Graphs -- An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem -- Greedy Minimum-Energy Scheduling -- Scheduling with Speed Predictions -- The Power of Amortization on Scheduling with Explorable Uncertainty -- Total Completion Time Scheduling Under Scenarios -- Approximating Fair k-Min-Sum-Radii in Euclidean Space -- Online hitting set of d-dimensional fat objects -- Approximation Schemes under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes -- Hitting Sets when the Shallow Cell Complexity is Small -- Any-Order Online Interval Selection -- Improved Approximations for Relative Survivable Network Design -- Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations -- Fast Parallel Algorithms for Submodular p-Superseparable Maximization.
Record Nr. UNISA-996574257903316
Cham, Switzerland : , : Springer, , [2023]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Approximation and Online Algorithms : 21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023, Proceedings / / Jaroslaw Byrka and Andreas Wiese, editors
Approximation and Online Algorithms : 21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023, Proceedings / / Jaroslaw Byrka and Andreas Wiese, editors
Edizione [First edition.]
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2023]
Descrizione fisica 1 online resource (XII, 236 p. 35 illus., 13 illus. in color.)
Disciplina 518.1
Collana Lecture Notes in Computer Science Series
Soggetto topico Online algorithms
Approximation algorithms
ISBN 3-031-49815-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optimization under Explorable Uncertainty: Adversarial and Stochastic Models -- Approximation Ineffectiveness of a Tour-Untangling Heuristic -- A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities -- Approximating Maximum Edge 2-Coloring by Normalizing Graphs -- An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem -- Greedy Minimum-Energy Scheduling -- Scheduling with Speed Predictions -- The Power of Amortization on Scheduling with Explorable Uncertainty -- Total Completion Time Scheduling Under Scenarios -- Approximating Fair k-Min-Sum-Radii in Euclidean Space -- Online hitting set of d-dimensional fat objects -- Approximation Schemes under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes -- Hitting Sets when the Shallow Cell Complexity is Small -- Any-Order Online Interval Selection -- Improved Approximations for Relative Survivable Network Design -- Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations -- Fast Parallel Algorithms for Submodular p-Superseparable Maximization.
Record Nr. UNINA-9910799485803321
Cham, Switzerland : , : Springer, , [2023]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Approximation and online algorithms : 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, proceedings / / Parinya Chalermsook, Bundit Laekhanukit (editors)
Approximation and online algorithms : 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, proceedings / / Parinya Chalermsook, Bundit Laekhanukit (editors)
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2022]
Descrizione fisica 1 online resource (264 pages)
Disciplina 005.1
Collana Lecture notes in computer science
Soggetto topico Approximation algorithms
Online algorithms
ISBN 3-031-18367-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996495568803316
Cham, Switzerland : , : Springer, , [2022]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Approximation and online algorithms : 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, proceedings / / Parinya Chalermsook, Bundit Laekhanukit (editors)
Approximation and online algorithms : 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, proceedings / / Parinya Chalermsook, Bundit Laekhanukit (editors)
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2022]
Descrizione fisica 1 online resource (264 pages)
Disciplina 005.1
Collana Lecture notes in computer science
Soggetto topico Approximation algorithms
Online algorithms
ISBN 3-031-18367-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910619276403321
Cham, Switzerland : , : Springer, , [2022]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Approximation and online algorithms : 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 : revised papers / / Evripidis Bampis, Klaus Jansen (eds.)
Approximation and online algorithms : 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 : revised papers / / Evripidis Bampis, Klaus Jansen (eds.)
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, : Springer-Verlag, 2010
Descrizione fisica 1 online resource (X, 255 p. 23 illus.)
Disciplina 005.11
Altri autori (Persone) BampisEvripidis
JansenKlaus
Collana Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Soggetto topico Approximation algorithms
Online algorithms
ISBN 1-280-38624-X
9786613564160
3-642-12450-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto WAOA 2009 -- On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems -- Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications -- Price Fluctuations: To Buy or to Rent -- Approximation Algorithms for Multiple Strip Packing -- Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window -- Longest Wait First for Broadcast Scheduling [Extended Abstract] -- The Routing Open Shop Problem: New Approximation Algorithms -- On the Price of Stability for Undirected Network Design -- Finding Dense Subgraphs in G(n,1/2) -- Parameterized Analysis of Paging and List Update Algorithms -- Online Scheduling of Bounded Length Jobs to Maximize Throughput -- On the Additive Constant of the k-Server Work Function Algorithm -- A (4?+??)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs -- Guard Games on Graphs: Keep the Intruder Out! -- Between a Rock and a Hard Place: The Two-to-One Assignment Problem -- Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width -- Online Minimization Knapsack Problem -- Optimization Problems in Multiple Subtree Graphs -- Multi-Criteria TSP: Min and Max Combined -- Packet Routing: Complexity and Algorithms -- Minimal Cost Reconfiguration of Data Placement in Storage Area Network -- Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing.
Record Nr. UNINA-9910484165803321
Berlin, : Springer-Verlag, 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Einfluss gleich- und gegensinniger Drehrichtung der Verbrennungsluftströme auf die Stabilisierung turbulenter Deppeldrall-Diffusionsflammen / / Klaus Merkle
Einfluss gleich- und gegensinniger Drehrichtung der Verbrennungsluftströme auf die Stabilisierung turbulenter Deppeldrall-Diffusionsflammen / / Klaus Merkle
Autore Merkle Klaus
Pubbl/distr/stampa [Place of publication not identified] : , : KIT Scientific Publishing, , 2006
Descrizione fisica 1 online resource (v, 155 pages)
Disciplina 551.515
Soggetto topico Approximation algorithms
Combustion deposits in engines
Turbulent diffusion (Meteorology)
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione ger
Record Nr. UNINA-9910688594803321
Merkle Klaus  
[Place of publication not identified] : , : KIT Scientific Publishing, , 2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
New Trends in Fuzzy Set Theory and Related Items / / Esteban Indurain, Javier Fernandez, Humberto Bustince, editors
New Trends in Fuzzy Set Theory and Related Items / / Esteban Indurain, Javier Fernandez, Humberto Bustince, editors
Pubbl/distr/stampa Basel, Switzerland : , : MDPI - Multidisciplinary Digital Publishing Institute, , 2018
Descrizione fisica 1 online resource (vii, 165 pages)
Disciplina 516.11
Soggetto topico Approximation algorithms
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910674021503321
Basel, Switzerland : , : MDPI - Multidisciplinary Digital Publishing Institute, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
New Trends in Fuzzy Set Theory and Related Items / / edited by Esteban Indurain, Javier Fernandez and Humberto Bustince
New Trends in Fuzzy Set Theory and Related Items / / edited by Esteban Indurain, Javier Fernandez and Humberto Bustince
Pubbl/distr/stampa Basel : , : MDPI, , 2018
Descrizione fisica 1 online resource (ix, 171 pages) : illustrations, charts
Disciplina 516.11
Soggetto topico Fuzzy sets
Fuzzy decision making
Approximation algorithms
ISBN 3-03897-124-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910765788003321
Basel : , : MDPI, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui