arXiv (All)
open access
Linear-Query Deterministic Approximation for Non-monotone Submodular Maximization under a Knapsack Constraint
Submodular maximization under a knapsack constraint (SMK) is a fundamental combinatorial optimization problem with broad applications across machine learning and data mining. Motivated by large-scale applications where query efficiency is paramount, we study non-monotone SMK and focus on determinist
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
- Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection#1155288
- Ensembles of Exactly Solved Subsamples for Clusterwise Regression: Trimming Without a Trimming Level#1105577
- Search engine optimization for dummies#465996
- Leveraging Knowledge Graphs and Explainable AI to Improve Employee Turnover Predictions#79258
- UniCoracle : automated hierarchical Feature Selection via Bottom-Up Propagation and Top-Down Skimming using the UniCorP algorithm and the Coracle machine-learning framework / Sebastian Staab, Anny Cárdenas, Raquel S. Peixoto, Falk Schreiber, Christian R. Voolstra#1106486
Record · ID 1061314
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