Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem
type: Item
instance of: scholarly article
title: Research on the efficient computation mechanism -- in the case of \(N\)-vehicle exploration problem
zbMATH Open document ID: 1395.68157
author: Fang Yu
author: Jin-Chuan Cui
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2018-09-18T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6938653
zbMATH Keywords: computational complexity
zbMATH Keywords: efficient computation mechanism
zbMATH Keywords: \(N\)-vehicle exploration problem
zbMATH Keywords: cluster
MaRDI profile type: Publication
full work available at URL: s10255-018-0774-6
OpenAlex ID: W2887343096
cites work: Q3241581
cites work: An Algebraic Theory of Complexity for Discrete Optimization
cites work: Q4786207
cites work: The Jeep Problem
cites work: Q4198056
cites work: On the Computational Complexity of Algorithms
cites work: On the Structure of Polynomial Time Reducibility
cites work: Q3640530
cites work: Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
cites work: Complexity of computations
cites work: Computational Complexity
cites work: Q4854014
cites work: Smoothed analysis of algorithms
cites work: A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
cites work: Q3054107
cites work: A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit
DOI: 10.1007/S10255-018-0774-6
description: scientific article; zbMATH DE number 6938653