Listing 1 - 3 of 3 |
Sort by
|
Choose an application
Complex analysis --- Discrete mathematics --- Computer science --- Computer. Automation --- discrete wiskunde --- complexe analyse (wiskunde) --- informatica --- numerieke analyse
Choose an application
This volume contains the papers presented at the 10th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2007) and the 11th International Workshop on Randomization and Computation (RANDOM 2007), which took place concurrently at Princeton University, on August 20-22, 2007. APPROX focuses on algorithmic and c- plexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and this was the 10th in the series after Aalborg (1998), Berkeley (1999), Saarbrucken (2000), Berkeley (2001), Rome ¨ (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), and Barcelona (2006). RANDOM is concerned with applications of randomness to compu- tional and combinatorial problems, and this was the 11th workshopin the series following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), and Barcelona (2006). Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network designandrouting,packingandcovering,scheduling,designandanalysisofr- domized algorithms, randomized complexity theory, pseudorandomness and - randomization,randomcombinatorialstructures,random walks/Markovchains, expander graphs and randomness extractors, probabilistic proof systems, r- dom projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of - proximation and randomness.
Complex analysis --- Discrete mathematics --- Computer science --- Computer. Automation --- discrete wiskunde --- complexe analyse (wiskunde) --- informatica --- numerieke analyse
Choose an application
Computer science --- Computer algorithms --- Informatique --- Algorithmes --- Statistical methods --- Congresses. --- Méthodes statistiques --- Congrès --- Computer Science --- Engineering & Applied Sciences --- Informatics --- Computer science. --- Software engineering. --- Algorithms. --- Numerical analysis. --- Computer Science. --- Software Engineering/Programming and Operating Systems. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Numeric Computing. --- Mathematics. --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Mathematical analysis --- Algorism --- Algebra --- Arithmetic --- Computer software engineering --- Engineering --- Science --- Mathematics --- Foundations --- Computer software. --- Computational complexity. --- Electronic data processing. --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Complexity, Computational --- Machine theory --- Software, Computer --- Computer systems --- Automation --- Computer science—Mathematics. --- Discrete mathematics. --- Software Engineering. --- Numerical Analysis. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis
Listing 1 - 3 of 3 |
Sort by
|