DEBT
发表于 2025-3-25 07:00:47
http://reply.papertrans.cn/16/1532/153104/153104_21.png
insular
发表于 2025-3-25 10:29:40
Conference proceedings 2015 France, in May 2015..The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers. The papers present original research in the theory and applications of algorithms and computational complexity.
护航舰
发表于 2025-3-25 14:16:36
https://doi.org/10.1007/978-3-319-18173-8Algorithmic game theory; Approximation algorithms; Combinatorial optimization; Combinatorics; Computatio
懒鬼才会衰弱
发表于 2025-3-25 16:34:56
978-3-319-18172-1Springer International Publishing Switzerland 2015
Institution
发表于 2025-3-25 21:46:24
http://reply.papertrans.cn/16/1532/153104/153104_25.png
Irrigate
发表于 2025-3-26 03:13:31
http://reply.papertrans.cn/16/1532/153104/153104_26.png
Overstate
发表于 2025-3-26 06:03:15
http://reply.papertrans.cn/16/1532/153104/153104_27.png
初学者
发表于 2025-3-26 08:34:09
https://doi.org/10.1007/978-3-476-05857-7 section. We consider the cartographic problem to place non-overlapping road labels along the edges so that as many road sections as possible are identified by their name, i.e., covered by a label. We show that this is NP-hard in general, but the problem can be solved in polynomial time if the road map is an embedded tree.
Somber
发表于 2025-3-26 13:29:23
http://reply.papertrans.cn/16/1532/153104/153104_29.png
GLARE
发表于 2025-3-26 19:35:23
http://reply.papertrans.cn/16/1532/153104/153104_30.png