82 search results - page 2 / 17 » Lower and upper bounds for a two-level hierarchical location... |
ALENEX
2007
13 years 7 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
TRANSCI
2011
13 years 21 days ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
ESA
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
IPPS
1999
IEEE
13 years 10 months ago
1999
IEEE
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...