4679 search results - page 33 / 936 » Modeling When Connections Are the Problem |
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by fol...
ASIAMS
2007
IEEE
15 years 4 months ago
2007
IEEE
The implicit approach can be used to efficiently model realistically deformable objects for large constraints such as stiffness or time. In soft bodies with pressure forces, model...
DCOSS
2009
Springer
15 years 2 months ago
2009
Springer
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
ENDM
2010
14 years 10 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...