订单价格
The Price of Order
摘要:
本文给出了一类有序$θ$-图的生成比的严格界。$θ$图将每个顶点周围的平面划分为$m$不相交的圆锥,每个圆锥具有孔径$θ= 2 π/m$。有序$θ$-图是通过逐个插入顶点并将每个顶点连接到每个锥中最近的先前插入的顶点来构造的。我们证明了对于任意整数$k \geq 1$,具有$4k + 4$锥的有序$θ$-图有紧生成比$1 + 2 \sin(θ/2) / (\cos(θ/2) - \sin(θ/2))$.我们还证明了对于任意整数$k \geq 2$,具有$4k + 2$锥的有序$θ$-图有紧生成比$1 / (1 - 2 \sin(θ/2))$.给出了具有$4k + 3$和$4k + 5$锥的有序$θ$-图的下界.对于具有$4k + 2$和$4k + 5$锥的有序$θ$-图,这些下界严格大于无序对应图的最坏情况生成比。这是第一次证明有序$θ$-图的生成比比无序$θ$-图的生成比差。最后,我们证明了,与它们的无序对应物,有序$θ$-图与4,5,和6锥不是spatial的。
英文摘要:
We present tight bounds on the spanning ratio of a large family of ordered $θ$-graphs. A $θ$-graph partitions the plane around each vertex into $m$ disjoint cones, each having aperture $θ= 2 π/m$. An ordered $θ$-graph is constructed by inserting the vertices one by one and connecting each vertex to the closest previously-inserted vertex in each cone. We show that for any integer $k \geq 1$, ordered $θ$-graphs with $4k + 4$ cones have a tight spanning ratio of $1 + 2 \sin(θ/2) / (\cos(θ/2) - \sin(θ/2))$. We also show that for any integer $k \geq 2$, ordered $θ$-graphs with $4k + 2$ cones have a tight spanning ratio of $1 / (1 - 2 \sin(θ/2))$. We provide lower bounds for ordered $θ$-graphs with $4k + 3$ and $4k + 5$ cones. For ordered $θ$-graphs with $4k + 2$ and $4k + 5$ cones these lower bounds are strictly greater than the worst case spanning ratios of their unordered counterparts. These are the first results showing that ordered $θ$-graphs have worse spanning ratios than unordered $θ$-graphs. Finally, we show that, unlike their unordered counterparts, the ordered $θ$-graphs with 4, 5, and 6 cones are not spanners.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。