"An Efficient Algorithm To Compute Distance Between Lexicographic ..."

Minyi Li, Borhan Kazimipour (2018)

> Home

Details and statistics

DOI: 10.24963/IJCAI.2018/262

access: open

type: Conference or Workshop Paper

metadata version: 2020-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/ijcai/LiK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/LiK18
Minyi Li, Borhan Kazimipour:
An Efficient Algorithm To Compute Distance Between Lexicographic Preference Trees. IJCAI 2018: 1898-1904

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.