Sciweavers

7150 search results - page 265 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 6 months ago
Approximated Structured Prediction for Learning Large Scale Graphical Models
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters effic...
Tamir Hazan, Raquel Urtasun
ECCC
2000
93views more  ECCC 2000»
15 years 6 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg
FOCS
2006
IEEE
16 years 21 days ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 7 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
16 years 7 months ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin