Publication:4818841
From MaRDI portal
zbMath1045.90532MaRDI QIDQ4818841
Christos H. Papadimitriou, Elias Koutsoupias, Mihalis Yannakakis
Publication date: 24 September 2004
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Complexity of decision-theoretic troubleshooting, Lower bounds in on-line geometric searching, The ultimate strategy to search on \(m\) rays?, Query strategies for priced information, Exact algorithms for the minimum latency problem, A new formulation for the traveling deliveryman problem
