Daniel Vaz

MaRDI QIDQ342054zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Buy-at-bulk facility location on trees	2026-02-10	Paper
On the approximability of the traveling salesman problem with line neighborhoods	2024-05-27	Paper
On approximating degree-bounded network design problems	2023-10-31	Paper
On approximating degree-bounded network design problems Algorithmica	2022-05-03	Paper
Survivable network design for group connectivity in low-treewidth graphs (available as arXiv preprint)	2021-08-04	Paper
Dynamics in matching and coalition formation games with structural constraints Artificial Intelligence	2019-01-18	Paper
Beyond metric embedding: approximating group Steiner trees on bounded treewidth graphs Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
New integrality gap results for the firefighters problem on trees Approximation and Online Algorithms	2017-04-04	Paper
A note on fractional coloring and the integrality gap of LP for maximum weight independent set	2017-02-14	Paper
Representation of the non-dominated set in biobjective discrete optimization Computers & Operations Research	2016-11-17	Paper
A note on the \(\epsilon\)-indicator subset selection Theoretical Computer Science	2014-01-10	Paper

Research outcomes over time

This page was built for person: Daniel Vaz