Fine-Grained Complexity and Algorithm Design Boot Camp Recent Advances in FPT and Exact Algorithms for NP-Complete Problems Dániel Marx Institute for Computer Science and Control,

Source URL: www.cs.bme.hu

11. A PPROXIMATION A LGORITHMS ‣ load balancing ‣ center selection ‣ pricing method: vertex cover ‣ LP rounding: vertex cover ‣ generalized load balancing

Source URL: vigna.di.unimi.it

• Scheduling
• Operations research
• NP-complete problems
• Complexity classes
• Combinatorial optimization
• Makespan
• Knapsack problem
• NP
• Algorithm
• Vertex cover
• Approximation algorithm
• Job shop scheduling

Blind, Greedy, and Random: Algorithms for Matching and Clustering using only Ordinal Information Elliot Anshelevich Shreyas Sekar

Source URL: www.cs.rpi.edu

• Matching
• Combinatorics
• NP-complete problems
• Combinatorial optimization
• Spanning tree
• Stable marriage problem
• Approximation algorithm
• 3-dimensional matching
• Minimum spanning tree

Lev Reyzin Clique Talk, 2007  

Source URL: www.levreyzin.com

• Mathematics
• Graph coloring
• NP-complete problems
• Hypergraph
• Discrete mathematics
• Theoretical computer science

On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich

Source URL: www.cs.rpi.edu

• Combinatorial optimization
• Graph theory
• NP-complete problems
• Network theory
• Edsger W. Dijkstra
• Steiner tree problem
• Simplex
• Matching
• Bipartite graph
• Graph
• Shortest path problem
• A* search algorithm

December 15, Fall 2008 Final Examination Introduction to Algorithms Massachusetts Institute of Technology

Source URL: courses.csail.mit.edu

• Graph theory
• Mathematics
• Computational complexity theory
• Network theory
• Spanning tree
• NP-complete problems
• Edsger W. Dijkstra
• Shortest path problem
• Longest path problem
• Minimum spanning tree
• Reverse-delete algorithm

Personal introduction Experience within Philips (focused on technical part) • Professional systems (mostly PC based) • Real-time embedded consumer systems • IC-design SW, NP-complete algorithms

Source URL: parse.ele.tue.nl

Bibliography [Abrams & Lloyd, 1998] Abrams, D.S., & Lloyd, SNonlinear Quantum Mechanics Implies Polynomial-Time Solution for NP-Complete and P Problems. Physical Review Letters, 81, 3992–5. [Adleman, 1994] A

Source URL: fab.cba.mit.edu

First-order satisfiability in Gödel logics: an NP-complete fragment Matthias Baaza,1 , Agata Ciabattonia,2 , Norbert Preininga,b,3 a b

Source URL: www.preining.info

• Logic
• Mathematical logic
• Abstraction
• Model theory
• Non-classical logic
• Logic in computer science
• Predicate logic
• First-order logic
• Boolean satisfiability problem
• Gdel numbering
• Many-valued logic
• Kripke semantics

Recovering Social Networks by Observing Votes Benjamin Fish and Yi Huang and Lev Reyzin Department of Mathematics, Statistics, & Computer Science University of Illinois at Chicago, Chicago, IL 60607 {bfish3,yihuang89,lre

Source URL: www.levreyzin.com

• Graph theory
• Bipartite graph
• Parity
• Graph
• Ear decomposition
• Matching
• NP-complete problems
• Graph coloring
• Line graph