274 search results - page 35 / 55 » The Polymatroid Steiner Problems |
88
Voted
CAD
2004
Springer
15 years 17 days ago
2004
Springer
This article discusses the reverse engineering problem of reconstructing objects with planar faces. We will present the main geometric features of a modeling system which are the ...
88
Voted
AE
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for...
93
Voted
SIAMDM
2008
15 years 19 days ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
120
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
ISPD
1999
ACM
15 years 5 months ago
1999
ACM
The presence of fixed terminals in hypergraph partitioning instances arising in top-down standard-cell placement makes such instances qualitatively different from the free hyperg...