3875 search results - page 86 / 775 » Approximation Algorithms for the Max-coloring Problem |
ENDM
2010
13 years 9 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
CP
2006
Springer
14 years 18 days ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
COLOGNETWENTE
2010
13 years 7 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
ISSAC
1995
Springer
14 years 13 days ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...