2137 search results - page 159 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
154
click to vote
EVOW
2010
Springer
15 years 11 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
177
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
154
Voted
DM
1998
15 years 6 months ago
1998
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
128
click to vote
AAAI
1998
15 years 7 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
171
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...