arXiv (All)
open access
Parameterized Hardness of Mixed 2-Sided Orthant Depth
We consider the maximum-depth problem for mixed 2-sided orthants in R^d: each region imposes one lower bound and one upper bound on distinct coordinates, and the task is to find a point contained in as many regions as possible. We show that the corresponding decision problem is W[1]-hard when parame
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 Complexity of Recognizing SDP Exactness for the Maximum Cut Problem#1123200
- Disjunctive Submodular Functions: Envelopes and Applications to Inventory and 0-1 Quadratic Optimization#1105271
- Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting#1077253
- Multiobjective Hypergraph Min-Cut in Quasi-Polynomial Time#927682
- Fractional Triangle Decompositions at Partite Minimum Degree $4n/5$#1115714
Record · ID 1144885
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