Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path ..."

Binay Bhattacharya et al. (2018)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2018.14

access: open

type: Conference or Workshop Paper

metadata version: 2019-05-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/BhattacharyaHKK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/BhattacharyaHKK18
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. ISAAC 2018: 14:1-14:13

a service of

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.