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 : 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 : 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 | ||
| ||
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 | ||
| ||
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 | ||
| ||
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 | ||
| ||
Approximation and online algorithms : third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005 : revised papers / / Thomas Erlebach, Giuseppe Persiano (eds.)
| Approximation and online algorithms : third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005 : revised papers / / Thomas Erlebach, Giuseppe Persiano (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2006 |
| Descrizione fisica | 1 online resource (X, 349 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
ErlebachThomas
PersianoGiuseppe |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Online algorithms
Mathematical optimization |
| ISBN | 3-540-32208-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | “Almost Stable” Matchings in the Roommates Problem -- On the Minimum Load Coloring Problem -- Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT -- The Hardness of Network Design for Unsplittable Flow with Selfish Users -- Improved Approximation Algorithm for Convex Recoloring of Trees -- Exploiting Locality: Approximating Sorting Buffers -- Approximate Fair Cost Allocation in Metric Traveling Salesman Games -- Rounding of Sequences and Matrices, with Applications -- A Note on Semi-online Machine Covering -- SONET ADMs Minimization with Divisible Paths -- The Conference Call Search Problem in Wireless Networks -- Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents -- Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost -- A Better-Than-Greedy Algorithm for k-Set Multicover -- Deterministic Online Optical Call Admission Revisited -- Scheduling Parallel Jobs with Linear Speedup -- Online Removable Square Packing -- The Online Target Date Assignment Problem -- Approximation and Complexity of k–Splittable Flows -- On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem -- Tighter Approximations for Maximum Induced Matchings in Regular Graphs -- On Approximating Restricted Cycle Covers -- A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs -- Speed Scaling of Tasks with Precedence Constraints -- Partial Multicuts in Trees -- Approximation Schemes for Packing with Item Fragmentation. |
| Altri titoli varianti | WAOA 2005 |
| Record Nr. | UNINA-9910483079503321 |
| Berlin, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and online algorithms : 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006 : revised papers / / Thomas Erlebach, Christos Kaklamanis (eds.)
| Approximation and online algorithms : 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006 : revised papers / / Thomas Erlebach, Christos Kaklamanis (eds.) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, : Springer, c2006 |
| Descrizione fisica | 1 online resource (X, 346 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
ErlebachThomas
KaklamanisChristos |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Online algorithms
Mathematical optimization |
| ISBN | 3-540-69514-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Approximation Algorithms for Scheduling Problems with Exact Delays -- Bidding to the Top: VCG and Equilibria of Position-Based Auctions -- Coping with Interference: From Maximum Coverage to Planning Cellular Networks -- Online Dynamic Programming Speedups -- Covering Many or Few Points with Unit Disks -- On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems -- Online k-Server Routing Problems -- Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem -- Improved Approximation Bounds for Edge Dominating Set in Dense Graphs -- A Randomized Algorithm for Online Unit Clustering -- On Hierarchical Diameter-Clustering, and the Supplier Problem -- Bin Packing with Rejection Revisited -- On Bin Packing with Conflicts -- Approximate Distance Queries in Disk Graphs -- Network Design with Edge-Connectivity and Degree Constraints -- Approximating Maximum Cut with Limited Unbalance -- Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems -- Improved Online Hypercube Packing -- Competitive Online Multicommodity Routing -- The k-Allocation Problem and Its Variants -- An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions -- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set -- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search -- Approximation Algorithms for Multi-criteria Traveling Salesman Problems -- The Survival of the Weakest in Networks -- Online Distributed Object Migration. |
| Altri titoli varianti | WAOA 2006 |
| Record Nr. | UNINA-9910484280403321 |
| Berlin, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and online algorithms : Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004 : revised selected papers / / Giuseppe Persiano, Roberto Solis-Oba (eds.)
| Approximation and online algorithms : Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004 : revised selected papers / / Giuseppe Persiano, Roberto Solis-Oba (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (VIII, 295 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
PersianoGiuseppe
Solis-ObaRoberto |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Online algorithms
Mathematical optimization |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Online Packet Switching -- Approximation Algorithms for Mixed Fractional Packing and Covering Problems -- Regular Papers -- Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees -- Online Bin Packing with Resource Augmentation -- A PTAS for Delay Minimization in Establishing Wireless Conference Calls -- This Side Up! -- Approximation Algorithm for Directed Multicuts -- Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria -- Approximation Algorithms for Spreading Points -- More Powerful and Simpler Cost-Sharing Methods -- Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints -- Priority Algorithms for Graph Optimization Problems -- Pricing Network Edges to Cross a River -- Submodular Integer Cover and Its Application to Production Planning -- Stochastic Online Scheduling on Parallel Machines -- A -Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path -- Order-Preserving Transformations and Greedy-Like Algorithms -- Off-line Admission Control for Advance Reservations in Star Networks -- Joint Base Station Scheduling -- Universal Bufferless Routing -- Strong Colorings of Hypergraphs -- Deterministic Monotone Algorithms for Scheduling on Related Machines -- Better Bounds for Minimizing SONET ADMs. |
| Altri titoli varianti | WAOA 2004 |
| Record Nr. | UNINA-9910767548803321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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 | ||
| ||
