Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for ..."

Jianer Chen, Iyad A. Kanj, Ge Xia (2005)

> Home

Details and statistics

DOI: 10.1007/S00453-004-1145-7

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ChenKX05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ChenKX05
Jianer Chen, Iyad A. Kanj, Ge Xia:
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. Algorithmica 43(4): 245-273 (2005)

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.