Mode and antimode graphs
- Authors: Ryan, Joe , Marshall, Kim
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the Sixteenth Australasian Workshop on Combinatorial Algorithms, Ballarat, Victoria : 18th - 21st September, 2005
- Full Text:
- Reviewed:
- Description: E1
- Description: 2003001389
Performance estimations of first fit algorithm for online bin packing with variable bin sizes and LIB constraints
- Authors: Manyem, Prabhu , Lin, J. Y. , Sheu, Ruey-Lin
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the Sixteenth Australasian Workshop on Combinatorial Algorithms, Ballarat, Victoria : 18th - 21st September, 2005
- Full Text:
- Reviewed:
- Description: We consider the NP Hard problem of online Bin Packing while requiring that larger (or longer) items be placed below smaller (or shorter) items --- we call such a version the {LIB} version of problems. Bin sizes can be uniform or variable. We provide analytical upper bounds as well as experimental results on the asymptotic approximation ratio for the first fit algorithm.
- Description: 2003001387
Repeats in graphs and digraphs
- Authors: Miller, Mirka , Nguyen, Minh Hoang , Simanjuntak, Rinovia
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the Sixteenth Australasian Workshop on Combinatorial Algorithms, Ballarat, Victoria : 18th - 21st September, 2005
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003001394
Optimisation solvers and problem formulations for solving a data clustering problem
- Authors: Ugon, Julien , Rubinov, Alex
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the Sixteenth Australasian Workshop on Combinatorial Algorithms, Ballarat, Victoria : 18th - 21st September, 2005
- Full Text:
- Reviewed:
- Description: A popular apprach for solving complex optimization problems is through relaxation: some constraints are removed in order to have a convex problem approximating the original problem. On the other hand, direct approaches for solving such problems are becoming increasingly powerful. This paper examines two cases drawn from data analysis, in order to compare the two techniques.
- Description: E1
- Description: 2003001437
Using anatomical therapeutic chemical (ATC) classification to reduce combinatorial complexity for Australian drug safety data analysis
- Authors: Saunders, Gary , Mammadov, Musa , Ivkovic, Sasha
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the Sixteenth Australasian Workshop on Combinatorial Algorithms, Ballarat, Victoria : 18th - 21st September, 2005
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003001449
Open problems in the construction of large directed graphs
- Authors: Dafik , Miller, Mirka , Ryan, Joe , Slamin,
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the Sixteenth Australasian Workshop on Combinatorial Algorithms, Ballarat, Victoria : 18th - 21st September, 2005
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003001352