Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Parinya Chalermsook"'
Autor:
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::246a46faa463276aacf92de49ec9f3fa
https://doi.org/10.1137/1.9781611977554.ch22
https://doi.org/10.1137/1.9781611977554.ch22
Autor:
Joachim Spoerhase, Margarita Capretto, Antonios Antoniadis, Peter Kling, Nidia Obscura Acosta, Lukas Nölke, Christoph Damerius, Parinya Chalermsook
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030835071
WADS
Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings, 85-100
STARTPAGE=85;ENDPAGE=100;TITLE=Algorithms and Data Structures
WADS
Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings, 85-100
STARTPAGE=85;ENDPAGE=100;TITLE=Algorithms and Data Structures
We consider minimum-cardinality Manhattan connected sets with arbitrary demands: Given a collection of points P in the plane, together with a subset of pairs of points in P (which we call demands), find a minimum-cardinality superset of P such that e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84d6b8a0cedf84aaf3e925115c450550
https://doi.org/10.1007/978-3-030-83508-8_7
https://doi.org/10.1007/978-3-030-83508-8_7
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030604394
WG
WG
In the Maximum Balanced Biclique Problem (MBB), we are given an n-vertex graph \(G=(V, E)\), and the goal is to find a balanced complete bipartite subgraph with q vertices on each side while maximizing q. The MBB problem is among the first known NP-h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9be1a4e9bc46609105d799c7b093e962
https://doi.org/10.1007/978-3-030-60440-0_19
https://doi.org/10.1007/978-3-030-60440-0_19
Autor:
Bundit Laekhanukit, Parinya Chalermsook, Marek Cygan, Danupon Nanongkai, Guy Kortsarz, Pasin Manurangsi, Luca Trevisan
Publikováno v:
SIAM Journal on Computing
We consider questions that arise from the intersection between the areas of polynomial-time approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable (FPT) algorithms....
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05bf70e7b18e48eafc591655e8a7b047
http://hdl.handle.net/11565/4033667
http://hdl.handle.net/11565/4033667
This book constitutes revised selected papers from the thoroughly refereed workshop proceedings of the 20th International Workshop on Approximation and Online Algorithms, WAOA 2022, which was colocated with ALGO 2022 and took place in Potsdam, German
Publikováno v:
Algorithmica, 81(10), 3993-4009
Algorithmica, 81(10), 3993-4009. Springer
Algorithmica
arXiv.org, e-Print Archive, Physics
Algorithmica, 81(10), 3993-4009. Springer
Algorithmica
arXiv.org, e-Print Archive, Physics
In this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and a parameter $\alpha>1$, and the goal is to design an $\alpha$-approximation algorithm with the fastest possib
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e6a7899749901d2aa9b12c01a3fa4f4
https://ir.cwi.nl/pub/29303
https://ir.cwi.nl/pub/29303
Autor:
Parinya Chalermsook, Daniel Vaz
Publikováno v:
Electronic Notes in Discrete Mathematics. 55:113-116
We prove a tight connection between two important notions in combinatorial optimization. Let G be a graph class (i.e. a subset of all graphs) and r ( G ) = sup G ∈ G χ f ( G ) ω ( G ) where χ f ( G ) and ω ( G ) are the fractional chromatic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d507a39fdae5ce261ad64f12f713f87
https://doi.org/10.1016/j.endm.2016.10.029
https://doi.org/10.1016/j.endm.2016.10.029
Publikováno v:
Mathematical Programming / B
We study the Unsplittable Flow problem ( $$\mathsf {UFP}$$ ) on trees with a submodular objective function. The input to this problem is a tree with edge capacities and a collection of tasks, each characterized by a source node, a sink node, and a de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4d0f3dde905e629c22506271158b331
https://aaltodoc.aalto.fi/handle/123456789/30248
https://aaltodoc.aalto.fi/handle/123456789/30248