5889 search results - page 260 / 1178 » Graph Layout Problems |
183
click to vote
SOFSEM
2010
Springer
16 years 1 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
154
click to vote
COCOON
2005
Springer
16 years 5 days ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
220
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
165
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, r...
204
click to vote
NIPS
2004
15 years 8 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...