scientific article; zbMATH DE number 7765415
From MaRDI portal
Publication:6065466
DOI10.4230/lipics.isaac.2020.57MaRDI QIDQ6065466
Csaba D. Tóth, Anirban Ghosh, Adrian Dumitrescu
Publication date: 14 November 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unsplittable coverings in the plane
- On plane geometric spanners: a survey and open problems
- Delaunay graphs are almost as good as complete graphs
- Algorithms for sensor systems. 6th international workshop on algorithms for sensor systems, wireless ad hoc networks, and autonomous mobile entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010. Revised selected papers
- Constructing plane spanners of bounded degree and low weight
- Sparse geometric graphs with small dilation
- Steiner minimal trees for regular polygons
- There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
- On sparse spanners of weighted graphs
- Unit disk graph recognition is NP-hard
- Plane hop spanners for unit disk graphs: simpler and better
- An improved upper bound on dilation of regular polygons
- Bounded-hops power assignment in ad hoc wireless networks
- The number of disk graphs
- Lattice spanners of low degree
- Geometric Spanner Networks
- On the shape of a set of points in the plane
- Steiner Minimal Tree for Points on a Circle
- Graph spanners
- Generating Low-Degree 2-Spanners
- Generating Sparse 2-Spanners
- EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
- Tight lower bounds for the size of epsilon-nets
- Approximation schemes for wireless networks
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- Lower Bounds on the Dilation of Plane Spanners
This page was built for publication:
