<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(0, 1), (1, 2), (2, 3), (3, 4)], compute the approximate maximum independent set using the networkx maximum_independent_set function from the approximation module.
### Response:
import networkx as nx
from networkx.algorithms import approximation as approx

# Create a graph
G = nx.Graph()
G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 4)])

# Compute the maximum independent set
independent_set = approx.maximum_independent_set(G)
print('The approximate maximum independent set is:', independent_set)
<|EOT|>
