Flexible Resource Allocation for Optical Networks Dmitriy Katz1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NY 10598.

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

• Operations research
• Computational complexity theory
• Approximation algorithms
• Complexity classes
• Mathematical optimization
• Polynomial-time approximation scheme
• Dynamic programming
• Linear programming
• Algorithm
• Theoretical computer science
• Applied mathematics
• Mathematics

Note This article is translated by a translation company from the corresponding original Chinese article in the Chinese section of this website. It is meant to be just an approximation of the original article for the ben

Source URL: www.swd.gov.hk

Nat. Hazards Earth Syst. Sci., 15, 657–669, 2015 www.nat-hazards-earth-syst-sci.netdoi:nhess © Author(sCC Attribution 3.0 License. Simulating tsunami propagation in fjords wi

Source URL: www.nat-hazards-earth-syst-sci.net

• Fluid dynamics
• Wave mechanics
• Dynamics
• Fluid mechanics
• Stranda
• Boussinesq approximation
• Dispersion
• Tsunami
• Hellesylt
• Water waves
• Physical oceanography
• Physics

Property Testing and Its Connection to Learning and Approximation ODED GOLDREICH Weizmann Institute of Science, Rehovot, Israel SHAFI GOLDWASSER

Source URL: www.cs.iastate.edu

• Graph coloring
• Aanderaa–Karp–Rosenberg conjecture
• Property testing
• Planar graph
• Clique
• Graph property
• Path decomposition
• Line graph
• Graph theory
• Mathematics
• Theoretical computer science

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 The Generalized Minimum Manhattan Network Problem (GMMN) – Scale-Diversity Aware Approximation and a Primal-Dual Algorithm Stefan Funke∗

Source URL: www.cccg.ca

• Convex optimization
• Operations research
• Linear programming
• Mathematical optimization
• Approximation algorithm
• Computational complexity theory
• Optimization problem
• Duality
• Algorithm
• Theoretical computer science
• Applied mathematics
• Mathematics

Modern Exact and Approximate MAP Algorithms for Graphical models Rina Dechter Bren School of Computer and Information Sciences, UC Irvine We will describe the potential of two known bounding approximation schemes for

Source URL: www.ics.uci.edu

• Algorithm
• Mathematical logic
• Linear programming
• Mathematics
• Applied mathematics
• Theoretical computer science

CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

Source URL: www.cccg.ca

• Mathematics
• Dominating set
• Unit disk graph
• Independent set
• APX
• Approximation algorithm
• Vertex cover
• Planar separator theorem
• Theoretical computer science
• Graph theory
• NP-complete problems

CCCG 2011, Toronto ON, August 10–12, 2011 Exact Algorithms and APX-Hardness Results for Geometric Set Cover Timothy M. Chan∗ Abstract

Source URL: 2011.cccg.ca

• Approximation algorithms
• Functions and mappings
• Computational complexity theory
• APX
• Logarithm
• Integral
• Function
• L-reduction
• Metric
• Mathematics
• Theoretical computer science
• Mathematical analysis

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 On the Rectangle Escape Problem Sepehr Assadi∗ Ehsan Emamjomeh-Zadeh∗

Source URL: www.cccg.ca

• Operations research
• Algorithm
• Mathematical logic
• Theoretical computer science
• Bin
• Rectangle
• Approximation algorithm
• Linear programming
• Integral
• Mathematics
• Geometry
• Applied mathematics

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract

Source URL: cccg.ca

• NP-complete problems
• Spanning tree
• Steiner tree problem
• Minimum spanning tree
• Time complexity
• Approximation algorithm
• Rectilinear Steiner tree
• Theoretical computer science
• Graph theory
• Computational complexity theory