Login / Signup

Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints.

Andrea TomassilliFrédéric GiroireNicolas HuinStéphane Pérennes
Published in: INFOCOM (2018)
Keyphrases
  • ordering constraints
  • web services
  • higher order
  • graph cuts
  • service oriented
  • d objects
  • orders of magnitude