Titlebook: Algorithms and Complexity; 9th International Co Vangelis Th. Paschos,Peter Widmayer Conference proceedings 2015 Springer International Publ

DEBT

insular

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.

護(hù)航艦

https://doi.org/10.1007/978-3-319-18173-8Algorithmic game theory; Approximation algorithms; Combinatorial optimization; Combinatorics; Computatio

懶鬼才會衰弱

978-3-319-18172-1Springer International Publishing Switzerland 2015

Institution

Irrigate

Overstate

初學(xué)者

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

GLARE