Approximating directed weighted-degree constrained networks

Keyphrases

• Degree Constrained 100%
• Weighted Degree 100%
• Constrained Networks 100%
• Unit Weight 42%
• Supermodular 42%
• Directed Graph 28%
• Edge Weight 28%
• Minimum Cost 28%
• In-degree 28%
• Degree Constraint 28%
• Approximation Algorithms 14%
• Polynomial-time Algorithm 14%
• Connected Subgraphs 14%
• Set Function 14%
• Edge-disjoint 14%
• Bicriteria Approximation Algorithms 14%
• Arborescence 14%
• Degree of a Node 14%
• Degree Bounds 14%
• Out-degree 14%
• 2-opt 14%

Computer Science

• Approximation Algorithms 100%
• Directed Graphs 100%
• Degree Constraint 100%
• Approximation (Algorithm) 50%
• Connected Subgraph 50%
• Subgraphs 50%
• Polynomial Time Algorithm 50%
• Maximum Packing 50%
• Outdegree 50%

Mathematics

• Weighted Degree 100%
• Edge 71%
• Unit Weight 42%
• Bicriteria 14%
• Polynomial Time 14%
• Set Function 14%