Deutsche Nationalbibliothek
metadata only
Approximation Algorithms for Discounted Graph Search with Norm Objectives / Svenja M. Griesbach, Felix Hommelsheim, Max Klimm
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
- An Arboricity-Sensitive Algorithm for the $K_r-e$-Free Graph Sandwich Problem#1049199
- A QMR-based interior-point algorithm for solving linear programs#429972
- Contextual Probability and Operational Minimality in Tug-of-War Decision Making#1355552
- LEVER: Adaptive Cost-Aware Proof Search Over AND/OR Graphs#1249142
- Adding an Edge in a $P_4$-sparse Graph#1343368
Record · ID 1188599
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