Approximating the Volume of Convex Bodies.
Approximation algorithms for metric tree cover and generalized tour and tree covers
Given a weighted undirected graph G = (V,E), a tree (respectively tour) cover of an edge-weighted graph is a set of edges which forms a tree (resp. closed walk) and covers every other edge in the graph. The tree (resp. tour) cover problem is of finding a minimum weight tree (resp. tour) cover of G. Arkin, Halldórsson and Hassin (1993) give approximation algorithms with factors respectively 3.5 and 5.5. Later Könemann, Konjevod, Parekh, and Sinha (2003) study the linear programming relaxations...
Approximation algorithms for some graph partitioning problems.
Approximation algorithms for the maximum induced planar and outerplanar subgraph problems.
Approximation algorithms for the traveling salesman problem with range condition
Approximation Algorithms for the Traveling Salesman Problem with Range Condition
We prove that the Christofides algorithm gives a approximation ratio for the special case of traveling salesman problem (TSP) in which the maximum weight in the given graph is at most twice the minimum weight for the odd degree restricted graphs. A graph is odd degree restricted if the number of odd degree vertices in any minimum spanning tree of the given graph is less than times the number of vertices in the graph. We prove that the Christofides algorithm is more efficient (in terms...
Approximation approach to performance evaluation of proxy cache server systems.
Approximation de séries formelles par des séries rationnelles
Approximation of phenol concentration using novel hybrid computational intelligence methods
Approximation of proximities by aggregating T-indistinguishability operators.
Approximations diophantiennes des nombres sturmiens
Nous établissons pour tout nombre sturmien (de développement dyadique sturmien) des propriétés d'approximation diophantienne très précises, ne dépendant que de l'angle de la suite sturmienne, généralisant ainsi des travaux antérieurs de Ferenczi-Mauduit et Bullett-Sentenac.
Approximations of believability functions under incomplete identification of sets of compatible states
Approximations of lattice-valued possibilistic measures
Lattice-valued possibilistic measures, conceived and developed in more detail by G. De Cooman in 1997 [2], enabled to apply the main ideas on which the real-valued possibilistic measures are founded also to the situations often occurring in the real world around, when the degrees of possibility, ascribed to various events charged by uncertainty, are comparable only quantitatively by the relations like “greater than” or “not smaller than”, including the particular cases when such degrees are not...
Approximations of weighted independent set and hereditary subset problems.
Arbitrary weight changes in dynamic trees
Arbology: Trees and pushdown automata
We present a unified and systematic approach to basic principles of Arbology, a new algorithmic discipline focusing on algorithms on trees. Stringology, a highly developed algorithmic discipline in the area of string processing, can use finite automata as its basic model of computation. For various kinds of linear notations of ranked and unranked ordered trees it holds that subtrees of a tree in a linear notation are substrings of the tree in the linear notation. Arbology uses pushdown automata...
Arbres infinis et systèmes d'équations
ARCO pour la programmation arithmétique et combinatoire
Are linear algorithms always good for linear problems?
Areas of lattice polygons, applied to computer graphics