Sciweavers

12519 search results - page 183 / 2504
» Approximation Problems Categories
Sort
View
AMC
2005
112views more  AMC 2005»
15 years 6 months ago
Mechanization for solving SPP by reducing order method
In this paper, by using the theories and methods of mathematical analysis and computer algebra, a reliable algorithm of reduction of order approximation method for solving singula...
Zhenqing Li, Weiming Wang
IPL
2000
96views more  IPL 2000»
15 years 6 months ago
On bounded occurrence constraint satisfaction
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
Johan Håstad
APPROX
2004
Springer
180views Algorithms» more  APPROX 2004»
15 years 12 months ago
A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
Markus Bläser
CGF
2005
170views more  CGF 2005»
15 years 6 months ago
Structure Recovery via Hybrid Variational Surface Approximation
Aiming at robust surface structure recovery, we extend the powerful optimization technique of variational shape approximation by allowing for several different primitives to repre...
Jianhua Wu, Leif Kobbelt
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
16 years 17 days ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim