2137 search results - page 294 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
158
Voted
NETWORKS
2008
15 years 5 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
160
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
164
click to vote
DAC
1997
ACM
15 years 9 months ago
1997
ACM
: Hardware-software co-synthesis is the process of partitioning an embedded system specification into hardware and software modules to meet performance, power and cost goals. In t...
172
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
131
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...