1480 search results - page 8 / 296 » Distributed algorithms for weighted problems in sparse graph... |
134
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
158
click to vote
STACS
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
152
click to vote
SAC
2000
ACM
15 years 9 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
150
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
131
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...