121 search results - page 4 / 25 » Planar case of the maximum box and related problems |
PPL
2000
13 years 7 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
WG
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average de...
CCCG
2006
13 years 9 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
IEAAIE
1994
Springer
13 years 11 months ago
1994
Springer
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...