Info
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 | ||
| ||
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 | ||
| ||
Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications / / Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.)
| Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications / / Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | New York, : Springer, 2006 |
| Descrizione fisica | 1 online resource (VII, 349 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
BampisEvripidis
JansenKlaus KenyonClaire |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computer algorithms
Online algorithms Combinatorial optimization - Data processing |
| ISBN | 3-540-32213-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks -- On Approximation Algorithms for Data Mining Applications -- A Survey of Approximation Results for Local Search Algorithms -- Approximation Algorithms for Path Coloring in Trees -- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow -- Independence and Coloring Problems on Intersection Graphs of Disks -- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications -- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines -- Approximating a Class of Classification Problems -- List Scheduling in Order of ?-Points on a Single Machine -- Approximation Algorithms for the k-Median Problem -- The Lovász-Local-Lemma and Scheduling. |
| Record Nr. | UNINA-9910484229603321 |
| New York, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Online stochastic combinatorial optimization / / Pascal Van Hentenryck and Russell Bent
| Online stochastic combinatorial optimization / / Pascal Van Hentenryck and Russell Bent |
| Autore | Van Hentenryck Pascal |
| Pubbl/distr/stampa | Cambridge, Mass., : MIT Press, ©2006 |
| Descrizione fisica | 1 online resource (247 p.) |
| Disciplina | 003 |
| Altri autori (Persone) | BentRussell |
| Soggetto topico |
Stochastic processes
Combinatorial optimization Online algorithms Operations research |
| Soggetto non controllato | COMPUTER SCIENCE/General |
| ISBN |
0-262-29998-4
1-282-09683-4 0-262-25715-7 0-262-51347-1 1-4294-7774-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | ""Preface""; ""1 Introduction""; ""2 Online Stochastic Scheduling""; ""3 Theoretical Analysis""; ""4 Packet Scheduling""; ""5 Online Stochastic Reservations""; ""6 Online Multiknapsack Problems""; ""7 Vehicle Routing with Time Windows""; ""8 Online Stochastic Routing""; ""9 Online Vehicle Dispatching""; ""10 Online Vehicle Routing with Time Windows""; ""11 Learning Distributions""; ""12 Historical Sampling""; ""13 Markov Chance-Decision Processes""; ""References""; ""Index"" |
| Record Nr. | UNINA-9910777797003321 |
Van Hentenryck Pascal
|
||
| Cambridge, Mass., : MIT Press, ©2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
