Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
A 2.5-factor approximation algorithm for the k-MST problemArya, Sunil ; Ramesh, H.Information processing letters, 1998-02, Vol.65 (3), p.117-118 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
A 7/8-approximation algorithm for metric Max TSPHASSIN, Refael ; RUBINSTEIN, ShlomiInformation processing letters, 2002-03, Vol.81 (5), p.247-251 [Periódico revisado por pares]Amsterdam: Elsevier ScienceTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
Abstracting numeric constraints with Boolean functionsHowe, Jacob M. ; King, AndyInformation processing letters, 2000-07, Vol.75 (1), p.17-23 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
Acyclic and k-distance coloring of the gridFertin, Guillaume ; Godard, Emmanuel ; Raspaud, AndréInformation processing letters, 2003-07, Vol.87 (1), p.51-58 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of verticesFiedorowicz, AnnaInformation processing letters, 2011-02, Vol.111 (6), p.287-290 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
Adding cardinality constraints to integer programs with applications to maximum satisfiabilityBläser, Markus ; Heynen, Thomas ; Manthey, BodoInformation processing letters, 2008-02, Vol.105 (5), p.194-198 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Agreement under faulty interfacesDasgupta, PallabInformation processing letters, 1998-02, Vol.65 (3), p.125-129 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
Algorithms and reductions for rewriting problems. IIVerma, RakeshInformation processing letters, 2002-11, Vol.84 (4), p.227-233 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant sizeManea, Florin ; Mitrana, VictorInformation processing letters, 2007-07, Vol.103 (3), p.112-118 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
An abstract interpretation framework for optimizing dynamic modular logic languagesCiampolini, Anna ; Lamma, Evelina ; Mello, PaolaInformation processing letters, 1996-05, Vol.58 (4), p.163-170 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |