Work

A 2 + ε approximation algorithm for the k-MST problem

Year: 2000

Type: conference-paper

Source: Symposium on Discrete Algorithms

DOI: 10.5555/338219.338636

Authors: Sanjeev Arora, George Karakostas

Institution: Princeton University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W3136945252

FWCI: 0.789

Cites: 14

Cited by: 14

Related to: 10