Approximation and Online Algorithms
-15%
portes grátis
Approximation and Online Algorithms
15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers
Fleischer, Rudolf; Solis-Oba, Roberto
Springer International Publishing AG
04/2018
329
Mole
Inglês
9783319894409
15 a 20 dias
522
Descrição não disponível.
Graph algorithms.- Inapproximability results.- Network design.- Packing and covering.- Paradigms for the design and analysis of approximation and online algorithms.- Parameterized complexity.- Scheduling problems.- Algorithmic game theory.- Coloring and partitioning.- Competitive analysis.- Computational advertising.- Computational finance.- Cuts and connectivity.- Geometric problems.- Mechanism design.- Resource augmentation.- Real-world applications.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Approximation algorithms;online algorithms;combinatorial optimization;networks;game theory;scheduling;packing and covering;graph theory;approximation algorithms;graphic methods;telecommunication networks;artificial intelligence;cluster analysis;clustering;bin packing;planar graph;directed graphs;randomized algorithms;nash equilibrium;algorithm analysis and problem complexity;data structures
Graph algorithms.- Inapproximability results.- Network design.- Packing and covering.- Paradigms for the design and analysis of approximation and online algorithms.- Parameterized complexity.- Scheduling problems.- Algorithmic game theory.- Coloring and partitioning.- Competitive analysis.- Computational advertising.- Computational finance.- Cuts and connectivity.- Geometric problems.- Mechanism design.- Resource augmentation.- Real-world applications.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Approximation algorithms;online algorithms;combinatorial optimization;networks;game theory;scheduling;packing and covering;graph theory;approximation algorithms;graphic methods;telecommunication networks;artificial intelligence;cluster analysis;clustering;bin packing;planar graph;directed graphs;randomized algorithms;nash equilibrium;algorithm analysis and problem complexity;data structures
