[英]Approximation for random coloring graph with 2 colors
Having trouble figuring out how to show this approximation, hoping someone could lend some advice.无法弄清楚如何显示这种近似值,希望有人可以提供一些建议。 I'm quite new to approximation (especially with randomization) and having trouble figuring out how to narrow this down.
我对近似(尤其是随机化)很陌生,并且无法弄清楚如何缩小范围。
The problem:问题:
Suppose we have a graph G = (V,E)
, each edge with a weight w
.假设我们有一个图
G = (V,E)
,每条边都有一个权重w
。
We want to color the graph with 2 colors, red
and blue
.我们想用 2 colors,
red
和blue
为图表着色。 We want to maximize the edge weight from each vertex from red
to blue
.我们希望最大化从
red
到blue
的每个顶点的边权重。
We randomly mark each vertex with either red
or blue
with probably 1/2
for each.我们随机用
red
或blue
标记每个顶点,每个顶点可能有1/2
。 The coloring is done independently of every vertex.着色独立于每个顶点完成。
I need to show that this color assignment randomization algorithm is a 4-approximaton
.我需要证明这种颜色分配随机化算法是
4-approximaton
。 However, not entirely sure where to start.但是,不完全确定从哪里开始。 Anyone have any ideas?
有人有想法么?
Even the simplest greedy algorithm will produce better approximations than randomly assigning colors.即使是最简单的贪心算法也会产生比随机分配 colors 更好的近似值。
Like this:像这样:
Mark all nodes uncolored
Mark all edges unprocessed
Sort edges into decreasing weight
LOOP until all edges processed
Select heaviest unprocessed edge
IF both nodes uncoloured
color nodes on edge opposite colors
IF one node uncolored
color node opposite color to its partner
mark edge processed
ENDLOOP
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.