Abstract
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
Cite
CITATION STYLE
APA
Gupta, A., Hajiaghayi, M. T., Nagarajan, V., & Ravi, R. (2007). Dial a ride from k-forest. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4698 LNCS, pp. 241–252). Springer Verlag. https://doi.org/10.1007/978-3-540-75520-3_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free