"APX-hardness and approximation for the k-burning number problem."

Debajyoti Mondal et al. (2022)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2022.08.001

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/MondalRPR22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MondalRPR22
Debajyoti Mondal, Angelin Jemima Rajasingh, N. Parthiban, Indra Rajasingh:
APX-hardness and approximation for the k-burning number problem. Theor. Comput. Sci. 932: 21-30 (2022)

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.