Skip to main content
Research
Focus areas
Blog
Publications
Careers
About
Back
Focus areas
Semiconductors
Artificial Intelligence
Quantum Computing
Hybrid Cloud
Back
About
Overview
Labs
People
Back
Semiconductors
Back
Artificial Intelligence
Back
Quantum Computing
Back
Hybrid Cloud
Back
Overview
Back
Labs
Back
People
Research
Focus areas
Semiconductors
Artificial Intelligence
Quantum Computing
Hybrid Cloud
Blog
Publications
Careers
About
Overview
Labs
People
Open IBM search field
Close
Journal of the ACM
Paper
26 Jun 1984
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
Download paper
Abstract
No abstract available.
Related
Conference paper
Average-case averages: Private algorithms for smooth sensitivity and mean estimation
Conference paper
Densely supervised grasp detector (DSGD)
Conference paper
Mina: Multilevel knowledge-guided attention for modeling electrocardiography signals
Conference paper
EvolveGCN: Evolving graph convolutional networks for dynamic graphs
View all publications
