Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

doi 10.1007/978-1-4020-9688-4_9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Netherlands

Related search

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

English

Degree-Constrained Subgraph Problems: Hardness and Approximation Results

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Distributed Algorithms for Minimum Cost Multicast With Network Coding

IEEE/ACM Transactions on Networking
Electronic EngineeringComputer NetworksCommunicationsComputer Science ApplicationsElectricalSoftware
2010English

Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(Network Design, Control and Optimization)

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
2004English

Approximation Algorithms for Connected Graph Factors of Minimum Weight

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2016English

Approximation Algorithms for a Class of Stochastic Selection Problems With Reward and Cost Considerations

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2018English

A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
MathematicsComputer Science
1995English

Approximation Algorithms for Partial Covering Problems*1

Journal of Algorithms
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy