Shifting strategy for geometric graphs without geometry

DOI10.1007/S10878-010-9319-5MaRDI QIDQ454249zbMATH OpenOpenAlexFDO

Authors Imran A. Pirwani

Publication date 1 October 2012

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-010-9319-5

zbMATH Keywords

computational geometryapproximation algorithmsshifting strategy

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Shifting strategy for geometric graphs without geometry
• Polynomial-time approximation schemes for geometric graphs
• Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
• Graph-Theoretic Concepts in Computer Science
• Approximation Algorithms for Geometric Intersection Graphs

Cites work

• scientific article; zbMATH DE number 5764804 (Why is no real title available?)
• scientific article; zbMATH DE number 5764844 (Why is no real title available?)
• scientific article; zbMATH DE number 1978147 (Why is no real title available?)
• scientific article; zbMATH DE number 2077132 (Why is no real title available?)
• A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
• A log-star distributed maximal independent set algorithm for growth-bounded graphs
• A tight bound on approximating arbitrary metrics by tree metrics
• Algorithmic Aspects of Wireless Sensor Networks
• Algorithms – ESA 2005
• Algorithms – ESA 2005
• Approximation algorithms for NP-complete problems on planar graphs
• Approximation algorithms for maximum independent set of pseudo-disks
• Approximation and Online Algorithms
• Approximation schemes for covering and packing problems in image processing and VLSI
• Approximation schemes for wireless networks
• Bypassing the embedding
• Distributed Computing
• Good Quality Virtual Realization of Unit Ball Graphs
• Graph-Theoretic Concepts in Computer Science
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
• On Metric Clustering to Minimize the Sum of Radii
• On a conjecture related to geometric routing
• On the locality of bounded growth
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
• Polynomial-time approximation schemes for packing and piercing fat objects
• Robust algorithms for restricted domains
• Some results on greedy embeddings in metric spaces
• Succinct greedy geometric routing in the Euclidean plane
• The intrinsic dimensionality of graphs
• Unit disk graph recognition is NP-hard

Cited in

(1)

• Shifting strategy for geometric graphs without geometry

This page was built for publication: Shifting strategy for geometric graphs without geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454249)