3396 search results - page 281 / 680 » Tree representations of graphs |
137
click to vote
ESA
2007
Springer
16 years 5 days ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
166
click to vote
ASPDAC
2005
ACM
15 years 11 months ago
2005
ACM
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
120
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
135
Voted
CSCWD
2008
Springer
15 years 7 months ago
2008
Springer
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
172
click to vote
COMCOM
2006
15 years 6 months ago
2006
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...