Login / Signup
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection.
Refael Hassin
Asaf Levin
Published in:
SIAM J. Comput. (2004)
Keyphrases
</>
polynomial time approximation
approximation algorithms
error bounds
np hard
vertex cover
greedy algorithm
bin packing
identical machines
simulated annealing
combinatorial optimization