Date of Original Version

10-2007

Type

Conference Proceeding

Abstract or Description

The k-forest problem is a common generalization of both the k-MST and the dense-k -subgraph problems. Formally, given a metric space on n vertices V, with m demand pairs ⊆ V ×V and a “target” k ≤ m, the goal is to find a minimum cost subgraph that connects at least k demand pairs.

DOI

10.1007/978-3-540-75520-3_23

Share

COinS
 

Published In

L. Arge, M. Hoffmann, and E. Welzl (Eds.): ESA 2007, LNCS 4698, 241-252.