Amanote Research
Register
Sign In
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
doi 10.1007/978-3-540-76796-1_9
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
Stefan Hougardy
Publisher
Springer Berlin Heidelberg
Related search
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
Linear Time Algorithms for Clustering Problems in Any Dimensions
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Cutting Plane Algorithms and State Space Constrained Linear Optimal Control Problems
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
Fast Approximation Algorithms for Multicommodity Flow Problems
Partial Sample Average Approximation Method for Chance Constrained Problems
Optimization Letters
Control
Optimization
Approximation Algorithms for Multi-Dimensional Vector Assignment Problems
SSRN Electronic Journal
