arXiv (All)
open access
Sublinear-Time and Semi-Streaming Algorithms for Path Cover and TSP
We give improved sublinear-time and semi-streaming approximation algorithms for maximum path cover, $(1,2)$-TSP, and Max-TSP. For each fixed $\eps>0$, our distance-query algorithm estimates the optimum cost of an $n$-vertex $(1,2)$-TSP instance from above within factor $2-\cstar+\eps=1.413184\ldots+
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
- Faster Planar Graph Algorithms for Connectivity Problems via Meanders#1249224
- Near-Optimal Streaming Approximation for Max-DICUT in Sublinear Space Using Two Passes / Santhoshini Velusamy#1188638
- Optimal Transport for Network Comparison: A Unified Review with New Spectral Bounds and Machine Learning Applications#1084344
- New transience bounds for long walks in weighted digraphs#629686
- A 0.4584-approximation for DR-submodular maximization over down-closed convex sets#1356408
Record · ID 1344199
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