Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Daniel J. Rosenkrantz
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
Related publications
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Distributed Algorithms for Minimum Cost Multicast With Network Coding
IEEE/ACM Transactions on Networking
Electronic Engineering
Computer Networks
Communications
Computer Science Applications
Electrical
Software
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(Network Design, Control and Optimization)
Journal of the Operations Research Society of Japan
Management Science
Decision Sciences
Operations Research
Approximation Algorithms for Connected Graph Factors of Minimum Weight
Theory of Computing Systems
Computational Theory
Theoretical Computer Science
Mathematics
Approximation Algorithms for a Class of Stochastic Selection Problems With Reward and Cost Considerations
Operations Research
Management Science
Computer Science Applications
Operations Research
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Mathematics
Computer Science
Approximation Algorithms for Partial Covering Problems*1
Journal of Algorithms