Paul Bracher Chem 30 – Synthesis Review Review Session Problem Set Hello, sports fans. The review session on Wednesday, January 12th, from 3-5 PM will cover the topic of organic synthesis. All material will be presente

Source URL: www.paulbracher.com

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Source URL: www.math.washington.edu

• Mathematics
• Computational complexity theory
• Algebra
• NP-complete problems
• Analysis of algorithms
• Set cover problem
• Bin packing problem
• Linear programming relaxation
• Vertex cover
• Ring
• Exponentiation
• Big O notation

SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

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

• Computational complexity theory
• Mathematics
• NP-complete problems
• Theory of computation
• Set cover problem
• Approximation algorithm
• Algorithm
• Analysis of algorithms
• Bin packing problem
• Vertex cover

comput. complex), 281 – 040281–27 DOIs00037c Birkh¨

Source URL: www.cs.huji.ac.il

• Computational complexity theory
• Graph theory
• NP-complete problems
• Mathematics
• Travelling salesman problem
• Set TSP problem
• Steiner tree problem
• Vertex cover
• Approximation algorithm
• APX
• Cut
• Time complexity

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. X,

Source URL: www.cs.uoi.gr

• Mathematics
• Operations research
• Computational complexity theory
• Combinatorics
• Combinatorial optimization
• NP-complete problems
• Set cover problem
• Greedy algorithm
• Heuristic
• Integer programming
• Matching
• Linear programming

PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡

Source URL: users.eecs.northwestern.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• NP-complete problems
• Operations research
• Approximation algorithms
• Combinatorial optimization
• Set cover problem
• Linear programming relaxation
• Greedy algorithm
• Facility location problem
• Reduction

Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen  Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218

Source URL: www.cs.tufts.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• NP-complete problems
• Operations research
• Set cover problem
• Approximation algorithm
• Facility location problem
• Dominating set
• Combinatorial optimization
• Reduction
• Algorithm

CS261: Exercise Set #8 For the week of February 22–26, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Source URL: theory.stanford.edu

• Mathematics
• Computational complexity theory
• Graph theory
• NP-complete problems
• Operations research
• Travelling salesman problem
• Theoretical computer science
• Approximation algorithm
• Steiner tree problem
• Greedy algorithm
• Optimization problem
• Set cover problem

Output-Sensitive Construction of the Union of Triangles  Esther Ezra and Micha Sharir School of Computer Science

Source URL: www.math.tau.ac.il

• Computational complexity theory
• Theory of computation
• Analysis of algorithms
• NP-complete problems
• Set cover problem
• Randomized algorithm
• Time complexity
• Minimum spanning tree
• Point location

Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis

Source URL: stefan.buettcher.org

• Computational complexity theory
• Theory of computation
• Mathematics
• NP-complete problems
• Set cover problem
• NP
• Dominating set
• Approximation algorithm
• Metric k-center
• Optimization problem
• Reduction
• P versus NP problem