Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Spanning trees with minimum weighted degrees
Information Processing Letters
Additive approximation for bounded degree survivable network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Additive guarantees for degree bounded directed network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Edge ranking and searching in partial orders
Discrete Applied Mathematics
Parameterized complexity of the smallest degree-constrained subgraph problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Additive Guarantees for Degree-Bounded Directed Network Design
SIAM Journal on Computing
Matroidal degree-bounded minimum spanning trees
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Parameterized complexity of finding small degree-constrained subgraphs
Journal of Discrete Algorithms
Improved algorithm for degree bounded survivable network design problem
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On generalizations of network design problems with degree bounds
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
We consider the problem of selecting a core node in a network under two potentially competing criteria, one being the sum of the distances to a set of terminals, the other being the cost of connecting this core node and the terminals with a Steiner tree. ...