arXiv (All)
open access
Polynomial-time algorithm for exact $(1,2)$-center problem under continuous Fréchet distance
In this paper, we explore the $(1,2)$-center problem for polygonal curves under continuous Fréchet distance. The $(k,\ell)$-center problem, in general, is known to be NP-hard. Aronov, Filtser, Horton, Katz, and Sheikhan (WADS'19) gave a polynomial-time algorithm for the $(1,2)$-center of curves in t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The method of ellipcenters with momentum and relaxation for convex quadratic minimization#794238
- The method of ellipcenters with momentum and relaxation for convex quadratic minimization#790219
- Minimum Spanning Trees for Square Crop Plots#1155742
- Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means#1048544
- Impartial removing games on grid graphs#1084015
Record · ID 1144259
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive