"Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the ..."

Sven Oliver Krumke et al. (2002)

> Home

Details and statistics

DOI: 10.1007/3-540-45753-4_18

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/approx/KrumkeLLMPPS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/KrumkeLLMPPS02
Sven Oliver Krumke, Luigi Laura, Maarten Lipmann, Alberto Marchetti-Spaccamela, Willem de Paepe, Diana Poensgen, Leen Stougie:
Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. APPROX 2002: 200-214

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.