Sciweavers

1272 search results - page 3 / 255
» Approximate Parameterized Matching
Sort
View
FUIN
2002
107views more  FUIN 2002»
13 years 7 months ago
Towards an Ontology of Approximate Reason
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...
James F. Peters, Andrzej Skowron, Jaroslaw Stepani...
COCO
2010
Springer
180views Algorithms» more  COCO 2010»
13 years 11 months ago
Completely Inapproximable Monotone and Antimonotone Parameterized Problems
We prove that weighted monotone/antimonotone circuit satisfiability has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT...
Dániel Marx
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
13 years 8 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
JDA
2006
90views more  JDA 2006»
13 years 7 months ago
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
Markus Bläser, Bodo Manthey, Jiri Sgall
RC
2002
103views more  RC 2002»
13 years 7 months ago
Exact Minkowski Products of N Complex Disks
An exact parameterization for the boundary of the Minkowski product of N circular disks in the complex plane is derived. When N > 2, this boundary curve may be regarded as a gen...
Rida T. Farouki, Helmut Pottmann