skip to main content
Language:
Results 1 2 3 4 5 next page
Result Number Material Type Add to My Shelf Action Record Details and Options
1
An algorithmforthe three-dimensional packing problem with asymptotic performance analysis
An algorithmforthe three-dimensional packing problem with asymptotic performance analysis
Material Type:
Article 		Add to e-Shelf

An algorithmforthe three-dimensional packing problem with asymptotic performance analysis

Flavio Keidi Miyazawa Yoshiko Wakabayashi

Algorithmica New York v. 18, n. 1, p. 122-144, 1997

New York 1997

Available at IME - Inst. Matemática e Estatística    (PROD-972819 )(GetIt)

2
Algorithms for scheduling sensors to maximize coverage time
Algorithms for scheduling sensors to maximize coverage time
Material Type:
Book 		Add to e-Shelf

Algorithms for scheduling sensors to maximize coverage time

Rafael da Ponte Barbosa Yoshiko Wakabayashi

Jünger, Michael; Reinelt, Gerhard, ed Facets of combinatorial optimization Berlin : Springer, 2013

Berlin Springer 2013

Available at IME - Inst. Matemática e Estatística    (PROD-3035032 )(GetIt)

3
Algorithms for terminal Steiner trees
Algorithms for terminal Steiner trees
Material Type:
Article 		Add to e-Shelf

Algorithms for terminal Steiner trees

Fábio Viduani Martinez José Coelho de Pina Júnior; Jose Augusto Ramos Soares

Theoretical Computer Science Amsterdam v. 389, n. 1-2, p. 133-142, 2007

Amsterdam 2007

Available at IME - Inst. Matemática e Estatística    (PROD-2932452 )(GetIt)

4
Algoritmos para o problema da árvore de Steiner com coleta de prêmios
Algoritmos para o problema da árvore de Steiner com coleta de prêmios
Material Type:
Master's Thesis 		Add to e-Shelf

Algoritmos para o problema da árvore de Steiner com coleta de prêmios

Matsubara, Camila Mari

Biblioteca Digital de Teses e Dissertações da USP; Universidade de São Paulo; Instituto de Matemática e Estatística 2012-12-14

Online access. The library also has physical copies.

5
Approximating minimum k-section in trees with linear diameter
Approximating minimum k-section in trees with linear diameter
Material Type:
Conference Paper 		Add to e-Shelf

Approximating minimum k-section in trees with linear diameter

Cristina Gomes Fernandes 1966- Tina Janne Schmidt; Anusch Taraz; Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS (8. 2015 Beberibe)

Electronic Notes in Discrete Mathematics v. 50, p. 71-76, Dec. 2015

Amsterdam 2015

Available at IME - Inst. Matemática e Estatística    (PROD-2738460 )(GetIt)

6
Approximating rational objectives is as easy as approximating linear ones
Approximating rational objectives is as easy as approximating linear ones
Material Type:
Conference Paper 		Add to e-Shelf

Approximating rational objectives is as easy as approximating linear ones

José R. Correa Júnior Cristina Gomes Fernandes 1966-; Yoshiko Wakabayashi; Scandinavian Workshop on algorithm theory - SWAT (10. 2006 Riga, Latvia)

Proceedings Berlin: Springer, 2006

Berlin Springer 2006

Available at IME - Inst. Matemática e Estatística    (PROD-1556709 ) and other locations(GetIt)

7
Approximation algorithms and hardness results for the clique packing problem
Approximation algorithms and hardness results for the clique packing problem
Material Type:
Conference Paper 		Add to e-Shelf

Approximation algorithms and hardness results for the clique packing problem

Frederic Chataigner Gordana Manic; Yoshiko Wakabayashi; Raphael Yuster; European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB (2007 Sevilla, Spain)

Electronic Notes in Discrete Mathematics Amsterdam v. 29, p. 397-401, 2007

Amsterdam 2007

Available at IME - Inst. Matemática e Estatística    (PROD-3035078 )(GetIt)

8
Approximation algorithms for combinatorial optimization third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings
Approximation algorithms for combinatorial optimization third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings
Material Type:
Book 		Add to e-Shelf

Approximation algorithms for combinatorial optimization third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings

Workshop on Approximation Algorithms for Combinatorial Optimization Problems (3rd 2000 Saarbrücken, Germany) Klaus Jansen; Samir Khuller

Berlin Springer New York c2000

Available at ICMC - Inst. Ciên. Mat. Computação    (68-02 LNCS v.1913 ) and other locations(GetIt)

9
Approximation algorithms for the max-buying problem with limited supply
Approximation algorithms for the max-buying problem with limited supply
Material Type:
Conference Paper 		Add to e-Shelf

Approximation algorithms for the max-buying problem with limited supply

Cristina Gomes Fernandes 1966- Rafael Crivellari Saliba Schouery; Latin American on Theoretical Informatics Symposium - LATIN 2014 (11. 2014 Montevideo)

LATIN 2014: theoretical informatics: Proceedings Heidelberg: Springer, 2014

Heidelberg Springer 2014

Available at IME - Inst. Matemática e Estatística    (PROD-2479779 )(GetIt)

10
Approximation algorithms for the Max-Buying problem with limited supply
Approximation algorithms for the Max-Buying problem with limited supply
Material Type:
Article 		Add to e-Shelf

Approximation algorithms for the Max-Buying problem with limited supply

Cristina Gomes Fernandes 1966- Rafael Crivellari Saliba Schouery

Algorithmica New York v. 80, n. 11, p. 2973–2992, 2018

New York 2018

Available at IME - Inst. Matemática e Estatística    (PROD-2854589 )(GetIt)

Results 1 2 3 4 5 next page

Personalize your results

  1. Edit

Refine Search Results

Refine My Results

Resource Type 

  1. Articles  (53)
  2. Academic Productions  (15)
  3. Books  (9)
  4. More options open sub menu

Creation Date 

From To
Refine
  1. Before2002  (9)
  2. 2002To2006  (14)
  3. 2007To2011  (16)
  4. 2012To2017  (20)
  5. After 2017  (18)
  6. More options open sub menu

Language 

  1. English  (63)
  2. Portuguese  (16)
  3. More options open sub menu

  • Implemented by: ABCD-USP USP   Social Network Logos: Freepik

Searching Remote Databases, Please Wait