Linked e-resources
Details
Table of Contents
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.
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.