1963 search results - page 115 / 393 » The Maximum Solution Problem on Graphs |
COR
2007
13 years 10 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
PARA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
SODA
1990
ACM
13 years 11 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
IEICET
2006
13 years 10 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
MCSS
2008
Springer
13 years 8 months ago
2008
Springer
We study optimal control problems for general unstructured nonlinear differential-algebraic equations of arbitrary index. In particular, we derive necessary conditions in the case ...