소장자료
| LDR | 04311nam a22006135i 4500 | ||
| 001 | 0100795214▲ | ||
| 003 | DE-He213▲ | ||
| 005 | 20240304101305▲ | ||
| 007 | cr nn 008mamaa▲ | ||
| 008 | 231221s2023 sz | s |||| 0|eng d▲ | ||
| 020 | ▼a9783031498152▼9978-3-031-49815-2▲ | ||
| 024 | 7 | ▼a10.1007/978-3-031-49815-2▼2doi▲ | |
| 050 | 4 | ▼aQA71-90▲ | |
| 082 | 0 | 4 | ▼a518▼223▲ |
| 245 | 1 | 0 | ▼aApproximation and Online Algorithms▼h[electronic resource] :▼b21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings /▼cedited by Jarosław Byrka, Andreas Wiese.▲ |
| 250 | ▼a1st ed. 2023.▲ | ||
| 264 | 1 | ▼aCham :▼bSpringer Nature Switzerland :▼bImprint: Springer,▼c2023.▲ | |
| 300 | ▼aXII, 236 p. 35 illus., 13 illus. in color.▼bonline resource.▲ | ||
| 336 | ▼atext▼btxt▼2rdacontent▲ | ||
| 337 | ▼acomputer▼bc▼2rdamedia▲ | ||
| 338 | ▼aonline resource▼bcr▼2rdacarrier▲ | ||
| 347 | ▼atext file▼bPDF▼2rda▲ | ||
| 490 | 1 | ▼aLecture Notes in Computer Science,▼x1611-3349 ;▼v14297▲ | |
| 505 | 0 | ▼aOptimization 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.▲ | |
| 520 | ▼aThis book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in Amsterdam, The Netherlands, during September 7–8, 2023 The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The topics of WAOA 2023 were algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT-approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems.▲ | ||
| 650 | 0 | ▼aMathematics▼xData processing.▲ | |
| 650 | 0 | ▼aData structures (Computer science).▲ | |
| 650 | 0 | ▼aInformation theory.▲ | |
| 650 | 0 | ▼aComputer science▼xMathematics.▲ | |
| 650 | 0 | ▼aDiscrete mathematics.▲ | |
| 650 | 0 | ▼aNumerical analysis.▲ | |
| 650 | 0 | ▼aAlgorithms.▲ | |
| 650 | 1 | 4 | ▼aComputational Mathematics and Numerical Analysis.▲ |
| 650 | 2 | 4 | ▼aData Structures and Information Theory.▲ |
| 650 | 2 | 4 | ▼aDiscrete Mathematics in Computer Science.▲ |
| 650 | 2 | 4 | ▼aSymbolic and Algebraic Manipulation.▲ |
| 650 | 2 | 4 | ▼aNumerical Analysis.▲ |
| 650 | 2 | 4 | ▼aDesign and Analysis of Algorithms.▲ |
| 700 | 1 | ▼aByrka, Jarosław.▼eeditor.▼4edt▼4http://id.loc.gov/vocabulary/relators/edt▲ | |
| 700 | 1 | ▼aWiese, Andreas.▼eeditor.▼4edt▼4http://id.loc.gov/vocabulary/relators/edt▲ | |
| 710 | 2 | ▼aSpringerLink (Online service)▲ | |
| 773 | 0 | ▼tSpringer Nature eBook▲ | |
| 776 | 0 | 8 | ▼iPrinted edition:▼z9783031498145▲ |
| 776 | 0 | 8 | ▼iPrinted edition:▼z9783031498169▲ |
| 830 | 0 | ▼aLecture Notes in Computer Science,▼x1611-3349 ;▼v14297▲ | |
| 856 | 4 | 0 | ▼uhttps://doi.org/10.1007/978-3-031-49815-2▲ |
Approximation and Online Algorithms[electronic resource] : 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings
자료유형
국외eBook
서명/책임사항
Approximation and Online Algorithms [electronic resource] : 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings / edited by Jarosław Byrka, Andreas Wiese.
판사항
1st ed. 2023.
형태사항
XII, 236 p. 35 illus., 13 illus. in color. online resource.
총서사항
Lecture Notes in Computer Science , 1611-3349 ; 14297
Lecture Notes in Computer Science , 1611-3349 ; 14297
Lecture Notes in Computer Science , 1611-3349 ; 14297
내용주기
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.
요약주기
This book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in Amsterdam, The Netherlands, during September 7–8, 2023 The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The topics of WAOA 2023 were algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT-approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems.
주제
Mathematics, Data processing.
Data structures (Computer science).
Information theory.
Computer science, Mathematics.
Discrete mathematics.
Numerical analysis.
Algorithms.
Computational Mathematics and Numerical Analysis.
Data Structures and Information Theory.
Discrete Mathematics in Computer Science.
Symbolic and Algebraic Manipulation.
Numerical Analysis.
Design and Analysis of Algorithms.
Data structures (Computer science).
Information theory.
Computer science, Mathematics.
Discrete mathematics.
Numerical analysis.
Algorithms.
Computational Mathematics and Numerical Analysis.
Data Structures and Information Theory.
Discrete Mathematics in Computer Science.
Symbolic and Algebraic Manipulation.
Numerical Analysis.
Design and Analysis of Algorithms.
ISBN
9783031498152
관련 인기대출 도서