On the rectangle escape problem
type: Item
instance of: scholarly article
title: On the rectangle escape problem
zbMATH Open document ID: 1372.68245
author: AmirMahdi Ahmadinejad
author: Sepehr Assadi
author: Ehsan Emamjomeh-Zadeh
author: Sadra Yazdanbod
author: Hamid Zarrabi-Zadeh
published in: Theoretical Computer Science
publication date: 2017-09-07T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6770412
zbMATH Keywords: rectangle escape
zbMATH Keywords: approximation algorithms
zbMATH Keywords: randomized rounding
zbMATH Keywords: NP-completeness
zbMATH Keywords: inapproximability
MaRDI profile type: MaRDI publication profile
full work available at URL: j.tcs.2017.05.040
OpenAlex ID: W2621825475
cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs
DOI: 10.1016/J.TCS.2017.05.040
Recommended article: Q4904194
Recommended article: The Robin problem on rectangles
Recommended article: The Narrow Escape Problem
Recommended article: On a Rectangle Inclusion Problem
Recommended article: On the maximum empty rectangle problem
Recommended article: The Dinitz problem solved for rectangles
Recommended article: The rectangular peg problem
Recommended article: A rectangular cover problem
Recommended article: Escaping a grid by edge-disjoint paths
Recommended article: Q4952693
description: scientific article; zbMATH DE number 6770412