Browsing by Subject Approximation algorithms

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:  
Showing results 1 to 9 of 9
PreviewIssue DateTitleAuthor(s)AdvisorType
2012A note on a Maximum k-Subset Intersection problemXavier, EC-Artigo de periódico
2009Three-dimensional packings with rotationsMIYAZAWA, F. K.; WAKABAYASHI, Y.-Artigo de periódico
2009Approximation algorithms and hardness results for the clique packing problemCHATAIGNER, F.; MANIC, G.; WAKABAYASHI, Y.; YUSTER, R.-Artigo de periódico
2013Heuristics for the strip packing problem with unloading constraintsda Silveira, JLM; Miyazawa, FK; Xavier, EC-Artigo de periódico
2018Approximation algorithms for the bus evacuation problemPedrosa, Lehilton L. C.; Schouery, Rafael C. S.-Artigo
2018Two-dimensional knapsack for circlesLintzmayer, Carla Negri; Miyazawa, Flávio Keidi; Xavier, Eduardo Candido-Artigo
2017A PTAS for the geometric connected facility location problemMiyazawa, Flávio K.; Pedrosa, Lehilton L. C.; Schouery, Rafael C. S.; Souza, Renata G. D. de-Artigo
2017A 3-approximation algorithm for the maximum leaf k-forest problemReis, M. F.; San Felice, M. C.; Lee, O; Usberti, F. L.-Artigo
2018Approximation algorithms for the max-buying problem with limited supplyFernandes, Cristina G.; Schouery, Rafael C. S.-Artigo
Showing results 1 to 9 of 9