(1+e)-Approximation for Facility Location in Data Streams Artur Czumaj Morteza Monemizadeh Christiane Lammersen

Source URL: ls2-www.cs.uni-dortmund.de

Efficient Approximation Schemes for Geometric Problems? ´ Daniel Marx ¨ zu Berlin

Source URL: www.cs.bme.hu

Approximation Algorithms and Hardness of the k-Route Cut Problem Julia Chuzhoy∗ Yury Makarychev† Aravindan Vijayaraghavan‡

Source URL: ttic.uchicago.edu

Seshadri constants, Diophantine approximation, and Roth's theorem for arbitrary varieties

Source URL: www.mast.queensu.ca

Approximation Algorithms for Genome Rearrangements (sorting signed permutations by reversals and transpositions) Qian-Ping Gu 1

Source URL: www.jsbi.org

Chapter 8 Facility Location The Metric Facility Location problem was popular in operations research in the 1960s but no constant factor approximation algorithms were known untilThe discovery of these is due to LP

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

221B Lecture Notes Scattering Theory II 1 Born Approximation

Source URL: hitoshi.berkeley.edu

On the Complexity of Solving a Bivariate Polynomial System Pavel Emeliyanenko Michael Sagraloff

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

• Mathematical analysis
• Mathematics
• Symbol
• Probability distributions
• Diophantine approximation
• Generalised Whitehead product
• Shifting nth root algorithm

Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems Julia Chuzhoy ∗ Computer Science Department Technion — IIT Haifa 32000, Israel

Source URL: ttic.uchicago.edu

PHYSICAL REVIEW E 88, Uniform asymptotic approximation of diffusion to a small target Samuel A. Isaacson1,* and Jay Newby2,† 1

Source URL: math.bu.edu