default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 932
Volume 932, October 2022
- Xiangyu Gao
, Jianzhong Li, Dongjing Miao:
Sublinear-time reductions for big data computing. 1-12 - Weizhi Hong, Yingli Ran, Zhao Zhang:
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph. 13-20 - Debajyoti Mondal, Angelin Jemima Rajasingh, N. Parthiban, Indra Rajasingh:
APX-hardness and approximation for the k-burning number problem. 21-30 - Runjie Miao, Jinjiang Yuan:
A note on LP-based approximation algorithms for capacitated facility location problem. 31-40 - Janio Carlos Nascimento Silva, Uéverton S. Souza:
Computing the best-case energy complexity of satisfying assignments in monotone circuits. 41-55 - Luérbio Faria, Uéverton S. Souza:
On the probe problem for (r, ℓ)-well-coveredness: Algorithms and complexity. 56-68 - Xujin Chen, Minming Li, Changjun Wang, Chenhao Wang, Mengqi Zhang, Yingchao Zhao:
Mechanisms for dual-role-facility location games: Truthfulness and approximability. 69-83 - Priyamvada, B. S. Panda:
Exact square coloring of certain classes of graphs: Complexity and algorithms. 84-101 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi:
New approximation algorithms for the heterogeneous weighted delivery problem. 102-115
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.
last updated on 2024-11-15 19:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
