arXiv (All)
open access
A Fast Greedy Algorithm with a 0.45 Approximation Guarantee for the Airplane Refueling Problem
We study a natural greedy algorithm for the Airplane Refueling Problem (ARP), based on a well-known priority rule. We show that this algorithm achieves an approximation guarantee of $9/20$, noticeably improving the previously known $1/12$ guarantee for a fast algorithm. We also show that the same pr
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
- Greedy Uniformity on Trees: Exact Obstruction and Near-Uniform Spiders#1186590
- Interpolating Decisions#711447
- Inclusion-wise extremal knapsack problems are (mostly) hard to approximate#1343214
- A Group-Based Resource Allocation Model for the Fractional Knapsack Problem#998403
- Integer Programming and Combinatorial Optimization#3580
Record · ID 1326472
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