Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Year of publication: |
2013
|
---|---|
Authors: | Bazgan, Cristina ; Toubaline, Sonia ; Vanderpooten, Daniel |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 26.2013, 1, p. 178-189
|
Subject: | most vital edges/nodes | min edge/node blocker | minimum spanning tree | complexity | approximation | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem |
-
Scheduling with agreements : new results
Bendraouche, Mohamed, (2016)
-
A Book of Open Shop Scheduling : Algorithms, Complexity and Applications
Kubiak, Wieslaw, (2022)
-
A new approach for the multiobjective minimum spanning tree
Santos, J. L., (2018)
- More ...
-
Critical edges for the assignment problem : complexity and exact resolution
Bazgan, Cristina, (2013)
-
Complexity of determining the most vital elements for the p-median and p-center location problems
Bazgan, Cristina, (2013)
-
Efficient determination of the k most vital edges for the minimum spanning tree problem
Bazgan, Cristina, (2012)
- More ...