scientific article; zbMATH DE number 1507300

From MaRDI portal
Publication:4504025

zbMath0955.05100MaRDI QIDQ4504025

Tomomi Matsui

Publication date: 13 February 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (22)

Reverse shortest path problem for unit-disk graphsLinear-Time Approximation Algorithms for Unit Disk GraphsFaster approximation for maximum independent set on unit disk graphRandomized on-line algorithms and lower bounds for computing large independent sets in disk graphsEfficient independent set approximation in unit disk graphsThe homogeneous broadcast problem in narrow and wide strips. I: AlgorithmsEstablishing herd immunity is hard even in simple geometric networksAn optimal algorithm for \(L_1\) shortest paths in unit-disk graphsApproximate strong separation with application in fractional graph coloring and preemptive scheduling.Unnamed ItemShifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection GraphsNear-optimal algorithms for shortest paths in weighted unit-disk graphsApproximation algorithms for maximum independent set of a unit disk graphThe within-strip discrete unit disk cover problemAn approximation algorithm for the general max-min resource sharing problemImproved Algorithm for Maximum Independent Set on Unit Disk GraphThe number of disk graphsLocal edge colouring of Yao-like subgraphs of unit disk graphsNear-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximationUnnamed ItemPerfectness and imperfectness of unit disk graphs on triangular lattice points




This page was built for publication: