Pages that link to "Item:Q4174528"
From MaRDI portal
The following pages link to An Analysis of the Greedy Heuristic for Independence Systems (Q4174528):
Displaying 50 items.
- An approximation algorithm for the maximum traveling salesman problem (Q293334) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Greedy matching: guarantees and limitations (Q513303) (← links)
- An estimate for the curvature of an order-convex set in the integer lattice and related questions (Q635600) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044) (← links)
- A heuristic lagrangean algorithm for the capacitated plant location problem (Q797475) (← links)
- Evolutionary algorithms and matroid optimization problems (Q848644) (← links)
- Saturation number of fullerene graphs (Q937610) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Analysis of heuristics for finding a maximum weight planar subgraph (Q1062924) (← links)
- The 2-quasi-greedy algorithm for cardinality constrained matroid bases (Q1079134) (← links)
- Clumsy packing of dominoes (Q1114697) (← links)
- An analysis of the greedy algorithm for partially ordered sets (Q1161533) (← links)
- Lower bounds on the worst-case complexity of some oracle algorithms (Q1251896) (← links)
- Matroids on partially ordered sets (Q1271880) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
- Approximations for the maximum acyclic subgraph problem (Q1332750) (← links)
- Maximizing traveling salesman problem for special matrices (Q1343160) (← links)
- Approximation algorithms for maximum dispersion (Q1375119) (← links)
- The doubly graded matrix cone and Ferrers matrices (Q1399239) (← links)
- Small maximal matchings in random graphs. (Q1401316) (← links)
- Hereditary systems and greedy-type algorithms. (Q1414589) (← links)
- Randomized strategies for cardinality robustness in the knapsack problem (Q1675929) (← links)
- Paroid search: Generic local combinatorial optimization (Q1801678) (← links)
- On the geometric structure of independence systems (Q1824559) (← links)
- Computing knapsack solutions with cardinality robustness (Q1926647) (← links)
- Surrogate optimization for \(p\)-norms (Q2010926) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Approximation by lexicographically maximal solutions in matching and matroid intersection problems (Q2118859) (← links)
- Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint (Q2218645) (← links)
- Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
- Size versus truthfulness in the house allocation problem (Q2319628) (← links)
- The power of randomness in Bayesian optimal mechanism design (Q2347783) (← links)
- Matroid representation of clique complexes (Q2381814) (← links)
- Modularity and greed in double auctions (Q2411517) (← links)
- Matroidal approximations of independence systems (Q2661525) (← links)
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications (Q2696953) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609) (← links)
- Buyback Problem - Approximate Matroid Intersection with Cancellation Costs (Q3012820) (← links)
- Unlabelled Partition Systems: Optimization and Complexity (Q3344219) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- Stability and Recovery for Independence Systems (Q5111712) (← links)
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location (Q5131704) (← links)
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← links)
- Unified Greedy Approximability beyond Submodular Maximization (Q6141865) (← links)
