The Maximum Weight Connected Subgraph Problem on Subclasses of Graphs
Location
Student Center
Document Type
Poster
Start Date
27-8-2026 11:40 AM
End Date
27-8-2026 12:40 PM
Description
The Maximum Weight Connected Subgraph Problem (MWCSP) is defined as follows: given a connected graph G = (V, E), a non-negative real-valued prize function on the vertices V, and a non-negative real-valued weight function on the edges E, we want to find a connected subgraph G’ = (V’, E’) of G which maximizes the sum of included vertex prizes minus edge weights in G’. It has been shown that the MWCSP is NP-Hard, meaning there exists no known polynomial time algorithm to solve it, and there probably never will be. We will show that on several subclasses of graphs, the MWCSP can be solved to optimality in polynomial time. In addition, we will discuss how these approaches can be used as approximation algorithms to solve the MWCSP for a general graph.
The Maximum Weight Connected Subgraph Problem on Subclasses of Graphs
Student Center
The Maximum Weight Connected Subgraph Problem (MWCSP) is defined as follows: given a connected graph G = (V, E), a non-negative real-valued prize function on the vertices V, and a non-negative real-valued weight function on the edges E, we want to find a connected subgraph G’ = (V’, E’) of G which maximizes the sum of included vertex prizes minus edge weights in G’. It has been shown that the MWCSP is NP-Hard, meaning there exists no known polynomial time algorithm to solve it, and there probably never will be. We will show that on several subclasses of graphs, the MWCSP can be solved to optimality in polynomial time. In addition, we will discuss how these approaches can be used as approximation algorithms to solve the MWCSP for a general graph.