743 search results - page 7 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
STACS
2001
Springer
14 years 4 days ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...