330 search results - page 2 / 66 » Approximation Algorithms for the Directed k-Tour and k-Strol... |
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
MOBIHOC
2007
ACM
14 years 4 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
ICCS
2009
Springer
13 years 12 months ago
2009
Springer
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
STOC
2006
ACM
13 years 11 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
WADS
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...