Pages that link to "Item:Q2368970"
From MaRDI portal
The following pages link to Complexity of approximating bounded variants of optimization problems (Q2368970):
Displaying 11 items.
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- A curve-shaping approach for determining bounds on H/sub ∞/ performance under hard constraints (Q5267150) (← links)
- Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem (Q5323050) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5473961) (← links)
- Fundamentals of Computation Theory (Q5900783) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900924) (← links)
- Fingerprint clustering with bounded number of missing values (Q5961971) (← links)
- There is no APTAS for 2-dimensional vector bin packing: revisited (Q6072215) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- Matchings under distance constraints. II. (Q6596960) (← links)
- Maximum locally irregular induced subgraphs via minimum irregulators (Q6671395) (← links)