Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Sumedha Uniyal"'
Publikováno v:
LATIN 2020: Theoretical Informatics ISBN: 9783030617912
LATIN
LATIN
We study the Steiner tree problem on map graphs, which substantially generalize planar graphs as they allow arbitrarily large cliques. We obtain a PTAS for Steiner tree on map graphs, which builds on the result for planar edge weighted instances of B
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::272df1f582c995dfac9d35ee12d237ee
https://doi.org/10.1007/978-3-030-61792-9_1
https://doi.org/10.1007/978-3-030-61792-9_1
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783319334608
IPCO
IPCO
We study the Capacitated k-Median problem, for which all the known constant factor approximation algorithms violate either the number of facilities or the capacities. While the standard LP-relaxation can only be used for algorithms violating one of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::575d9198eb41a52931232384af9eccec
https://doi.org/10.1007/978-3-319-33461-5_22
https://doi.org/10.1007/978-3-319-33461-5_22
Publikováno v:
Approximation and Online Algorithms ISBN: 9783319286839
WAOA
WAOA
In the well-studied Unsplittable Flow on a Path problem (UFP), we are given a path graph with edge capacities. Furthermore, we are given a collection of n tasks, each one characterized by a subpath, a weight, and a demand. Our goal is to select a max
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab117243dd099e030d7e430efa7d3daf
https://doi.org/10.1007/978-3-319-28684-6_2
https://doi.org/10.1007/978-3-319-28684-6_2