30 search results - page 3 / 6 » jda 2006 |
JDA
2006
13 years 9 months ago
2006
JDA
2006
13 years 9 months ago
2006
JDA
2006
13 years 9 months ago
2006
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
JDA
2006
13 years 9 months ago
2006
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
JDA
2006
13 years 9 months ago
2006
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...