<｜begin▁of▁sentence｜>### Instruction:
Given a graph with nodes A, B, C, D, and E with respective weights 10, 1, 1, 5, and 3 and edge set [('A', 'B'), ('A', 'C'), ('B', 'D'), ('C', 'D'), ('D', 'E')], can you compute a dominating set that approximates the minimum weight node dominating set using the NetworkX function min_weighted_dominating_set?
### Response:
import networkx as nx
from networkx.algorithms.approximation import min_weighted_dominating_set

# Create a graph
G = nx.Graph()
G.add_node('A', weight=10)
G.add_node('B', weight=1)
G.add_node('C', weight=1)
G.add_node('D', weight=5)
G.add_node('E', weight=3)
G.add_edges_from([('A', 'B'), ('A', 'C'), ('B', 'D'), ('C', 'D'), ('D', 'E')])

# Compute the minimum weighted dominating set
result_set = min_weighted_dominating_set(G, weight='weight')
print('Minimum Weighted Dominating Set:', result_set)
<|EOT|>
