Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...