Author： Rote G.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.172, Iss.1, 1997-02, pp. : 303-308
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A relation of primal-dual lattices and the complexity of shortest lattice vector problem
By Cai J.-Y.
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
Access to resources
Recommend
Finding the shortest boundary guard of a simple polygon
By Lu B.-K. Hsu F.-R. Tang C.Y.
Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. :
Finding the most vital node of a shortest path
By Nardelli E. Proietti G. Widmayer P.
Theoretical Computer Science, Vol. 296, Iss. 1, 2003-03 ,pp. :
Two-dimensional packing with conflicts
By Epstein Leah Levin Asaf Stee Rob
Acta Informatica, Vol. 45, Iss. 3, 2008-05 ,pp. :