752 search results - page 30 / 151 » Faster approximation algorithms for the minimum latency prob... |
105
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
123
click to vote
ADHOCNOW
2005
Springer
15 years 6 months ago
2005
Springer
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
104
click to vote
TCS
2008
15 years 1 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
105
click to vote
SOFSEM
2007
Springer
15 years 7 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
140
click to vote
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...