✦ LIBER ✦

The Spatial Search Problem: Structure and Complexity

✍ Scribed by Gunther Maier

Book ID: 109147944
Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 665 KB
Volume: 25
Category: Article
ISSN: 0016-7363
DOI: 10.1111/j.1538-4632.1993.tb00295.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

MODELING STRATEGIES FOR THE SPATIAL SEAR

MODELING STRATEGIES FOR THE SPATIAL SEARCH PROBLEM

✍ Harvey J. Miller 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 597 KB

Spatial mismatch, search effort, and urb

Spatial mismatch, search effort, and urban spatial structure

✍ Tony E. Smith; Yves Zenou 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 238 KB

On the Complexity of Local Search for th

On the Complexity of Local Search for the Traveling Salesman Problem

✍ Papadimitriou, Christos H.; Steiglitz, Kenneth 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 894 KB

On the part inventory model sequencing p

On the part inventory model sequencing problem: complexity and Beam Search heuristic

✍ Malte Fliedner; Nils Boysen; Armin Scholl 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 429 KB

Parameterized Complexity and Local Searc

Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties

✍ Dániel Marx; Ildikó Schlotter 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 740 KB

The Relative Complexity of NP Search Pro

The Relative Complexity of NP Search Problems

✍ Paul Beame; Stephen Cook; Jeff Edmonds; Russell Impagliazzo; Toniann Pitassi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 521 KB

Papadimitriou introduced several classes of NP search problems based on combinatorial principles which guarantee the existence of solutions to the problems. Many interesting search problems not known to be solvable in polynomial time are contained in these classes, and a number of them are complete