Shifting strategy for geometric graphs without geometry
type: Item
instance of: scholarly article
title: Shifting strategy for geometric graphs without geometry
zbMATH Open document ID: 1269.90131
author: Imran A. Pirwani
published in: Journal of Combinatorial Optimization
publication date: 2012-10-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6088782
zbMATH Keywords: shifting strategy
zbMATH Keywords: computational geometry
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: s10878-010-9319-5
OpenAlex ID: W1982549992
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: Algorithmic Aspects of Wireless Sensor Networks
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: Algorithms – ESA 2005
cites work: Unit disk graph recognition is NP-hard
cites work: Polynomial-time approximation schemes for packing and piercing fat objects
cites work: Approximation algorithms for maximum independent set of pseudo-disks
cites work: Q3579393
cites work: Q3579437
cites work: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
cites work: A tight bound on approximating arbitrary metrics by tree metrics
cites work: On Metric Clustering to Minimize the Sum of Radii
cites work: Succinct Greedy Geometric Routing in the Euclidean Plane
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: Q4470517
cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
cites work: The intrinsic dimensionality of graphs
cites work: Distributed Computing
cites work: On the locality of bounded growth
cites work: Polynomial time approximation schemes for base station coverage with minimum total radii
cites work: Some results on greedy embeddings in metric spaces
cites work: Q4424137
cites work: Approximation and Online Algorithms
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Approximation schemes for wireless networks
cites work: On a conjecture related to geometric routing
cites work: Good Quality Virtual Realization of Unit Ball Graphs
cites work: A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
cites work: Robust algorithms for restricted domains
cites work: A log-star distributed maximal independent set algorithm for growth-bounded graphs
cites work: Bypassing the embedding
DOI: 10.1007/S10878-010-9319-5
description: scientific article; zbMATH DE number 6088782