Flip distance between triangulations of a planar point set is APX-hard-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Flip distance between triangulations of a planar point set is APX-hard

Published:2014-07 Issue:5 Volume:47 Page:589-604
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Pilz Alexander

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference33 articles.

1. Every large point set contains many collinear points or an empty pentagon;Abel;Graphs Comb.,2011

2. Flip distance between triangulations of a simple polygon is NP-complete;Aichholzer,2013

3. Some APX-completeness results for cubic graphs;Alimonti;Theor. Comput. Sci.,2000

4. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999

5. Approximation algorithms for NP-complete problems on planar graphs;Baker;J. ACM,1994

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The rotation distance of brooms;European Journal of Combinatorics;2024-05

2. Short Flip Sequences to Untangle Segments in the Plane;Lecture Notes in Computer Science;2024

3. An $$\mathcal {O}(3.82^{k})$$ Time $$\textsf {FPT}$$ Algorithm for Convex Flip Distance;Discrete & Computational Geometry;2023-11-05

4. A survey of parameterized algorithms and the complexity of edge modification;Computer Science Review;2023-05

5. Complexity results on untangling red-blue matchings;Computational Geometry;2023-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP