Deterministic Sampling Algorithms for Network Design Anke van Zuylen Abstract For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample

Source URL: arvanzuijlen.people.wm.edu

Polynomial-time special cases of NP-hard problems

Source URL: zoo.cs.yale.edu

A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012

Source URL: www.daviddelaat.nl

• Graph theory
• Mathematics
• NP-complete problems
• Information theory
• Combinatorial optimization
• NP-hard problems
• Lovsz number
• Independent set

TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

Source URL: www.ads.tuwien.ac.at

• Graph theory
• Operations research
• Mathematics
• Computational complexity theory
• Network flow
• NP-complete problems
• NP-hard problems
• Travelling salesman problem
• Multi-commodity flow problem
• Flow network

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1

Source URL: people.mpi-inf.mpg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-hard problems
• NP-complete problems
• Edsger W. Dijkstra
• Combinatorial optimization
• Approximation algorithms
• Travelling salesman problem
• Shortest path problem
• Matching
• Randomized algorithm

LNCSA Standard Framework for Timetabling Problems

Source URL: stefan.buettcher.org

• Constraint programming
• Mathematical optimization
• Artificial intelligence
• Theoretical computer science
• Applied mathematics
• Constraint logic programming
• NP-hard problems
• Operations research
• Genetic algorithm
• Nurse scheduling problem
• Constrained optimization

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d

Source URL: people.mpi-inf.mpg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Combinatorial optimization
• NP-hard problems
• Approximation algorithms
• Edsger W. Dijkstra
• Travelling salesman problem
• Nearest neighbour algorithm
• Shortest path problem
• Maximal independent set

Capacity of Arbitrary Wireless Networks Olga Goussevskaia Roger Wattenhofer Computer Engineering and

Source URL: disco.ethz.ch

• Computational complexity theory
• Graph theory
• Mathematics
• NP-complete problems
• Combinatorial optimization
• NP-hard problems
• Graph coloring
• Signal-to-interference-plus-noise ratio
• NC
• Open set
• Independent set
• Matching

CS2101 Due: Tuesday 2nd of December 2014 Problem Set 3 CS2101

Source URL: www.csd.uwo.ca

• Computational complexity theory
• Mathematics
• Theory of computation
• Operations research
• NP-hard problems
• Analysis of algorithms
• Asymptotic analysis
• Big O notation
• Mathematical notation
• NP
• Travelling salesman problem
• Gap reduction

Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann Tobias Friedrich

Source URL: people.mpi-inf.mpg.de

• Mathematical analysis
• Mathematics
• Approximation algorithms
• Polynomial-time approximation scheme
• Pi
• NP-hard problems
• -net