An algorithm for node-capacitated ring routing

András Frank, Zoltán Király, Balázs Kotnyek

Research output: Contribution to journalConference article


A strongly polynomial time algorithm is described to solve the node-capacitated routing problem in an undirected ring network.

Original languageEnglish
Pages (from-to)249-258
Number of pages10
JournalLecture Notes in Computer Science
Publication statusPublished - 2005
Event13th Annual European Symposium on Algorithms, ESA 2005 - Palma de Mallorca, Spain
Duration: Oct 3 2005Oct 6 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An algorithm for node-capacitated ring routing'. Together they form a unique fingerprint.

  • Cite this