Sciweavers

9176 search results - page 133 / 1836
» algorithms 2010
Sort
View
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
16 years 1 months ago
VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension
Elchanan Mossel, Christos Papadimitriou, Michael S...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
16 years 1 months ago
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
GECCO
2010
Springer
253views Optimization» more  GECCO 2010»
15 years 6 months ago
Comparison of G3PCX and Rosenbrock's algorithms on the BBOB noiseless testbed
Generalized generation gap algorithm with parent centric crossover is compared with Rosenbrock’s optimization algorithm. Both algorithms were already presented at the BBOB 2009 ...
Petr Posík
146
Voted
FOCS
2010
IEEE
15 years 2 months ago
Subexponential Algorithms for Unique Games and Related Problems
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
Sanjeev Arora, Boaz Barak, David Steurer
CORR
2010
Springer
97views Education» more  CORR 2010»
15 years 4 months ago
A Linear-time Algorithm for Sparsification of Unweighted Graphs
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...
Ramesh Hariharan, Debmalya Panigrahi