599 search results - page 43 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
ENDM
2008
14 years 9 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
FUIN
2007
14 years 9 months ago
2007
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
92
Voted
WDAG
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
DAM
1999
14 years 9 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...