Computing and Combinatorics
From MaRDI portal
Publication:5716937
DOI10.1007/11533719zbMath1128.90319OpenAlexW4376561447MaRDI QIDQ5716937
Roger Wattenhofer, Aaron Zollinger, Fabian Kuhn, Pascal von Rickenbach, Ermo Welzl
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Related Items
Minimum ply covering of points with disks and squares ⋮ Parameterized complexity of minimum membership dominating set ⋮ Minimum ply covering of points with unit squares ⋮ Minimizing interference of a wireless ad-hoc network in a plane ⋮ Parameterized complexity of minimum membership dominating set ⋮ The checkpoint problem ⋮ Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems ⋮ A kernelization algorithm for \(d\)-hitting set ⋮ Minimum membership covering and hitting ⋮ Red-blue covering problems and the consecutive ones property
This page was built for publication: Computing and Combinatorics
