Algorithms with large domination ratio
Authors:
- Noga AlonNANoga Alon
- Gregory GutinGGGregory Gutin
- Michael KrivelevichMKMichael Krivelevich
- 1 January 2004
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 50 (1) , 118-131
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Domination analysis of combinatorial optimization problemsDiscrete Applied Mathematics, 2003
- Maximum cuts and judicious partitions in graphs without short cyclesJournal of Combinatorial Theory, Series B, 2003
- Voting paradoxes and digraphs realizationsAdvances in Applied Mathematics, 2002
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination numberDiscrete Applied Mathematics, 2002
- Anti-matroidsOperations Research Letters, 2002
- Proof of a hypercontractive estimate via entropyIsrael Journal of Mathematics, 2001
- Bipartite subgraphsCombinatorica, 1996
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- Some Extremal Properties of Bipartite SubgraphsCanadian Journal of Mathematics, 1973
- On a lemma of Littlewood and OffordBulletin of the American Mathematical Society, 1945