Pages that link to "Item:Q3453561"
From MaRDI portal
The following pages link to Polynomial-Time Data Reduction for the Subset Interconnection Design Problem (Q3453561):
Displaying 11 items.
- The minimum feasible tileset problem (Q666670) (← links)
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667) (← links)
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles (Q2042074) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
- A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem (Q5114944) (← links)
- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem (Q5197998) (← links)
- Overlaying a hypergraph with a graph with bounded maximum degree (Q5918772) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- The role of twins in computing planar supports of hypergraphs (Q6616221) (← links)
- Placing green bridges optimally, with a multivariate analysis (Q6635698) (← links)
