149
Voted
COCOON
15 years 8 months ago
2007 Springer 
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
115
click to vote
COCOON
15 years 8 months ago
2007 Springer
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
131
Voted
COCOON
15 years 6 months ago
2007 Springer 
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
115
Voted
COCOON
15 years 8 months ago
2007 Springer 
It is shown that the traveling salesman problem for graphs
133
Voted
COCOON
15 years 6 months ago
2007 Springer 
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
|
Combinatorics