Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems∗ Julia Chuzhoy †

Source URL: ttic.uchicago.edu

Topological approximation by small simplicial complexes Gunnar Carlsson 1 , Vin de Silva ∗,1 Department of Mathematics, Building 380, Stanford University CA, USA.

Source URL: pages.pomona.edu

Optimal ancilla-free Clifford+T approximation of z-rotations QIP 2015 Neil J. Ross and Peter Selinger Dalhousie University, Halifax, Canada

Source URL: www.quantum-lab.org

Karin Schnass* (), Porto Conte Ricerche, 07041 Alghero, Italy. A tour from sparse approximation over dictionary learning to random sparse properties of frames. Preliminary report. Overcomple

Source URL: jointmathematicsmeetings.org

Solution Quality and Efficiency in Discrete Optimization 2 Scientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Mathematics
• Theory of computation
• Operations research
• NP-complete problems
• Mathematical optimization
• Convex optimization
• Travelling salesman problem
• Approximation algorithm
• Optimization problem
• Algorithm
• Genetic algorithm

370 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 14, NO. 3, MARCH 2005 Demosaicing by Successive Approximation Xin Li, Member, IEEE

Source URL: www.csee.wvu.edu

Approximation Algorithms and Hardness of Integral Concurrent Flow Parinya Chalermsook∗ Julia Chuzhoy †

Source URL: ttic.uchicago.edu

APPROXIMATION RESISTANT PREDICATES FROM PAIRWISE INDEPENDENCE Per Austrin and Elchanan Mossel Abstract. We study the approximability of predicates on k variables

Source URL: www.csc.kth.se

Part II Approximation Algorithms 37

Source URL: www2.informatik.hu-berlin.de

A Characterization of Strong Approximation Resistance Algorithm Hardness

Source URL: ttic.uchicago.edu