Tractability
From MaRDI portal
Publication:5175727
DOI10.1017/CBO9781139177801zbMath1325.68009OpenAlexW4240405664MaRDI QIDQ5175727
No author found.
Publication date: 25 February 2015
Full work available at URL: https://doi.org/10.1017/cbo9781139177801
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Distributed strategy selection: a submodular set function maximization approach ⋮ The follower competitive facility location problem under the nested logit choice rule ⋮ Learning with fuzzy hypergraphs: a topical approach to query-oriented text summarization ⋮ I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
This page was built for publication: Tractability
