<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose nodes have associated weights and edge set is [('A', 'B'), ('B', 'C')], can you determine the approximate minimum weighted dominating set using NetworkX?
### Response:
import networkx as nx

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

# Find the approximate minimum weighted dominating set
approx_dominating_set = nx.algorithms.approximation.min_weighted_dominating_set(G, weight='weight')
print('Approximate Minimum Weighted Dominating Set:', approx_dominating_set)
<|EOT|>
