Pages that link to "Item:Q2368970"
From MaRDI portal
The following pages link to Complexity of approximating bounded variants of optimization problems (Q2368970):
Displaying 48 items.
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Identifying path covers in graphs (Q396675) (← links)
- Complexity of majority monopoly and signed domination problems (Q414422) (← links)
- Approximation complexity of metric dimension problem (Q450564) (← links)
- Improved and simplified inapproximability for \(k\)-means (Q506167) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Inapproximability of maximal strip recovery (Q551208) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- Catastrophic cascading failures in power networks (Q896112) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- Approximability and inapproximability of the minimum certificate dispersal problem (Q982648) (← links)
- Approximation of the \(k\)-batch consolidation problem (Q1006079) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- APX-hardness of maximizing Nash social welfare with indivisible items (Q1675918) (← links)
- A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- Computing envy-freeable allocations with limited subsidies (Q2152144) (← links)
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) (Q2182087) (← links)
- Greed is good for deterministic scale-free networks (Q2205637) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Proportionally dense subgraph of maximum size: complexity and approximation (Q2334039) (← links)
- Bounded clique cover of some sparse graphs (Q2359963) (← links)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- Maximal strip recovery problem with gaps: hardness and approximation algorithms (Q2434927) (← links)
- On a connection between small set expansions and modularity clustering (Q2446591) (← links)
- Triangle strings: structures for augmentation of vertex-disjoint triangle sets (Q2448121) (← links)
- Second-price ad auctions with binary bids and markets with good competition (Q2453168) (← links)
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs (Q2700783) (← links)
- Cascading Critical Nodes Detection with Load Redistribution in Complex Systems (Q2942413) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (Q2980912) (← links)
- On Variants of the Spanning Star Forest Problem (Q3004657) (← links)
- Approximation of a batch consolidation problem (Q3113503) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- Caching with Time Windows and Delays (Q5092509) (← links)
- (Q5115779) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem (Q5323050) (← 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)
