scientific article; zbMATH DE number 3848612

MaRDI QIDQ3318111zbMATH OpenFDO

Authors Richard Karp

Publication date 1982

zbMATH Keywords

ellipsoid methodenumerationheuristic algorithmsnetwork problemsNPNP- hardnessNP-completenessPprobabilistic analysisreliabilitysimplex method

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3999286
• Computational Complexity of Network Reliability Analysis: An Overview
• scientific article; zbMATH DE number 218387
• scientific article; zbMATH DE number 2161745
• scientific article; zbMATH DE number 858902

Cited in

(17)

• A very personal reminiscence on the problem of computational complexity
• The complexity of reconfiguring network models
• Computation of irregularity indices of certain computer networks
• scientific article; zbMATH DE number 1810469 (Why is no real title available?)
• On the np-completeness of certain network testing problems
• scientific article; zbMATH DE number 4145830 (Why is no real title available?)
• scientific article; zbMATH DE number 3934404 (Why is no real title available?)
• Computational Complexity of Network Reliability Analysis: An Overview
• scientific article; zbMATH DE number 4057259 (Why is no real title available?)
• The complexity of computations by networks
• A simple variant of node connectivity is NP-complete
• Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
• scientific article; zbMATH DE number 2161745 (Why is no real title available?)
• scientific article; zbMATH DE number 3999286 (Why is no real title available?)
• The congenial talking philosophers problem in computer networks
• Time and Energy Complexity of Function Computation Over Networks
• The computational complexity of the criticality problems in a network with interval activity times

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3318111)