1347 search results - page 19 / 270 » On the Structure of the Minimum Time Function |
136
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
115
click to vote
STOC
1995
ACM
15 years 7 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
183
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
138
Voted
WIOPT
2006
IEEE
15 years 9 months ago
2006
IEEE
— In this paper, a scheduling problem in wireless networks is considered when there simultaneously exist CBR (constant bit rate) users requiring exact minimum average throughput ...
139
click to vote
MONET
2006
15 years 3 months ago
2006
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...