Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson)

1982/01/01 by Juris Hartmanis · 14 citations
Computer Science · #Computability, Logic, AI Algorithms #Software Reliability and Analysis Research #Distributed systems and fault tolerance

paper · doi:10.1137/1024022

Cited by

• A Coarse Geometric Approach to Graph Layout Problems
• Neural Graph Navigation for Intelligent Subgraph Matching
• Transferable Equivariant Quantum Circuits for TSP: Generalization Bounds and Empirical Validation
• Dynamic DNN Decomposition for Lossless Synergistic Inference
• Variables Ordering Optimization in Boolean Characteristic Set Method Using Simulated Annealing and Machine Learning-based Time Prediction
• An interdisciplinary survey of network similarity methods
• GeoLayer: Towards Low-Latency and Cost-Efficient Geo-Distributed Graph Stores with Layered Graph
• The Maximum Coverage Model and Recommendation System for UAV Vertiports Location Planning
• Quantization through Piecewise-Affine Regularization: Optimization and Statistical Guarantees
• Bus Fleet Electrification Planning Through Logic-Based Benders Decomposition and Restriction Heuristics
• Challenges in Applying Variational Quantum Algorithms to Dynamic Satellite Network Routing
• Graph Classification Based on Skeleton and Component Features
• DREAM: Scalable Red Teaming for Text-to-Image Generative Systems via Distribution Modeling
• Making Logic a First-Class Citizen in Generative ML for Networking