Pages that link to "Item:Q4504997"
From MaRDI portal
The following pages link to Approximations of Weighted Independent Set and Hereditary Subset Problems (Q4504997):
Displaying 37 items.
- An effective discrete dynamic convexized method for solving the winner determination problem (Q306103) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Independent sets in semi-random hypergraphs (Q832900) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722) (← links)
- On the hardness of approximating max-satisfy (Q1045886) (← links)
- Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
- Approximating weighted neighborhood independent sets (Q1679903) (← links)
- The graph segmentation problem (Q1742196) (← links)
- On the differential approximation of MIN SET COVER (Q1770405) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- On the approximability of clique and related maximization problems (Q1877696) (← links)
- Speeding-up structured probabilistic inference using pattern mining (Q2353925) (← links)
- Inapproximability and approximability of maximal tree routing and coloring (Q2498986) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- Improved approximations for weighted and unweighted graph problems (Q2581009) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- Pricing on paths: a PTAS for the highway problem (Q2796210) (← links)
- On the maximum uniquely restricted matching for bipartite graphs (Q2840733) (← links)
- Maximum Weighted Independent Sets with a Budget (Q2971655) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- On-line models and algorithms for max independent set (Q3411297) (← links)
- Combinatorial Auctions with Conflict-Based Externalities (Q3460791) (← links)
- Approximating Independent Set and Coloring in Random Uniform Hypergraphs (Q3599156) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
- On Constant Time Approximation of Parameters of Bounded Degree Graphs (Q4933372) (← links)
- (Q4938668) (← links)
- (Q5075740) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- The Power of Oblivious Wireless Power (Q5269826) (← links)
- Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)