Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Fully Polynomial-Time Approximation Schemes for the Max-Min Connected ..."

Bang Ye Wu (2012)

> Home

Details and statistics

DOI: 10.1142/S179383091250005X

access: closed

type: Journal Article

metadata version: 2020-08-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dmaa/Wu12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmaa/Wu12
Bang Ye Wu:
Fully Polynomial-Time Approximation Schemes for the Max-Min Connected Partition Problem on Interval Graphs. Discret. Math. Algorithms Appl. 4(1) (2012)

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.