Approximation and Online Algorithms
portes grátis
Approximation and Online Algorithms
21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings
Byrka, Jaroslaw; Wiese, Andreas
Springer International Publishing AG
12/2023
236
Mole
Inglês
9783031498145
15 a 20 dias
Descrição não disponível.
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
approximation algorithms;combinatorial optimization;computer networks;graph theory;correlation analysis;Online algorithms;Dynamic algorithms;Scheduling;Geometric problems;Network design;Convex relaxations
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
