Zobrazeno 1 - 10
of 26
pro vyhledávání: '"GRAPH THEORY (MATHEMATICS)"'
Autor:
Jartoux, Bruno, Mustafa, Nabil H.
Publikováno v:
34th International Symposium on Computational Geometry (SoCG 2018)
34th International Symposium on Computational Geometry (SoCG 2018), Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs.SoCG.2018.48⟩
34th International Symposium on Computational Geometry (SoCG 2018), Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs.SoCG.2018.48⟩
International audience; Up until a decade ago, the algorithmic status of several basic NP-complete problems in geometric combinatorial optimisation was unresolved. This included the existence of polynomial-time approximation schemes (PTASs) for hitti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9db4089521cfec3b5d7fac2e62c24bb9
https://hal.archives-ouvertes.fr/hal-01797822
https://hal.archives-ouvertes.fr/hal-01797822
Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportati
Autor:
Sprock, Andreas
ISBN:978-3-906031-30-9
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::883ed41ad2f86b6d75271675dd2b4fc5
https://hdl.handle.net/20.500.11850/65500
https://hdl.handle.net/20.500.11850/65500
Autor:
Knudsen, Joakim Grahl, Riera, Constanza, Danielsen, Lars Eirik, Parker, Matthew G., Rosnes, Eirik
Publikováno v:
International Zurich Seminar on Communications-Proceedings
International Zurich Seminar on Communications - Proceedings
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cbefe2983f236063b7e4bbf7a1d6a1c