Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
From MaRDI portal
Publication:612969
zbMATH Open1204.05090MaRDI QIDQ612969FDOQ612969
W. Duckworth, Nicholas Wormald
Publication date: 16 December 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/226613
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- On the worst case complexity of potential reduction algorithms for linear programming
- On the greedy solution in integer linear programming
- Worst-case analyses, linear programming and the bin-packing problem
- scientific article; zbMATH DE number 2192085
- scientific article; zbMATH DE number 4116586
- Worst case analysis of a greedy algorithm for graph thickness
- Linear programming and primal-dual problems in graph theory
- scientific article; zbMATH DE number 1263283
- A general class of greedily solvable linear programs
- Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs
Cited In (10)
- Minimum maximal matchings in cubic graphs
- A tight bound for independent domination of cubic graphs without 4‐cycles
- Minimum independent dominating sets of random cubic graphs
- Worst case analysis of a greedy algorithm for graph thickness
- Connected domination of regular graphs
- On the independent domination number of regular graphs
- Independent dominating sets in regular graphs
- A structural approach for independent domination of regular graphs
- Title not available (Why is that?)
- Approximation hardness of edge dominating set problems
This page was built for publication: Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612969)
