Share Your Research, Maximize Your Social Impacts
Main Menu
Searching By
PARTNERS
WAOA 2014 - Workshop on Approximation and Online Algorithms
Topics/Call fo Papers
Papers are solicited in all research areas related to approximation and online algorithms, including, but not limited to:
algorithmic game theory
algorithmic trading
coloring and partitioning
competitive analysis
computational advertising
computational finance
cuts and connectivity
geometric problems
graph algorithms
inapproximability results
mechanism design
natural algorithms
network design
packing and covering
paradigms for the design and analysis of approximation and online algorithms
parameterized complexity
real-world applications
scheduling problems
Publication
Proceedings will be published after the workshop takes place in the Springer series Lecture Notes in Computer Science. Instructions for authors can be found at Springer web site.
algorithmic game theory
algorithmic trading
coloring and partitioning
competitive analysis
computational advertising
computational finance
cuts and connectivity
geometric problems
graph algorithms
inapproximability results
mechanism design
natural algorithms
network design
packing and covering
paradigms for the design and analysis of approximation and online algorithms
parameterized complexity
real-world applications
scheduling problems
Publication
Proceedings will be published after the workshop takes place in the Springer series Lecture Notes in Computer Science. Instructions for authors can be found at Springer web site.
Other CFPs
- Workshop on Algorithms in Bioinformatics
- Workshop on Massive Data Algorithmics
- International Symposium on Parameterized and Exact Computation
- Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
- International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
Last modified: 2014-01-07 23:13:54