783 search results - page 6 / 157 » Improved approximation algorithms for the freeze-tag problem |
EUROCAST
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
IPL
2011
13 years 3 months ago
2011
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
COCOON
2004
Springer
14 years 2 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
WEA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
MOR
2000
13 years 8 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...