217 search results - page 5 / 44 » Approximating Minimum Manhattan Networks |
103
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
Given a network, a set of demands and a cost function f(
117
click to vote
JCO
2010
14 years 11 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
106
click to vote
ESA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
111
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
123
click to vote
STACS
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...