Login / Signup

A greedy approach combined with graph coloring for non-uniform beam layouts under antenna constraints in multibeam satellite systems.

Jean-Thomas CaminoStéphane MourguesChristian ArtiguesLaurent Houssin
Published in: ASMS/SPSC (2014)
Keyphrases
  • graph coloring
  • combinatorial problems
  • constraint programming
  • search algorithm
  • np complete problems
  • search space
  • combinatorial optimization
  • greedy algorithm
  • phase transition
  • resource constraints