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
Topology attack and defense for graph neural networks: An optimization perspective
Conference paper
Aligning learning outcomes to learning resources: A lexico-semantic spatial approach
Conference paper
Towards fine-grained temporal network representation via time-reinforced random walk
Conference paper
RDPD: Rich data helps poor data via imitation
View all publications
