2137 search results - page 154 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
163
click to vote
PODC
2006
ACM
16 years 6 days ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
178
click to vote
EVOW
2001
Springer
15 years 10 months ago
2001
Springer
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
169
click to vote
DATE
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper proposes a novel methodology tailored to design embedded systems, taking into account the emerging market needs, such as hw/sw partitioning, object-oriented specificati...
197
click to vote
WADS
2009
Springer
16 years 25 days ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
170
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...