Sciweavers

DMTCS
2010
133views Mathematics» more  DMTCS 2010»
13 years 2 months ago
An improved bound on the largest induced forests for triangle-free planar graphs
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...
Lukasz Kowalik, Borut Luzar, Riste Skrekovski
TCS
2010
13 years 3 months ago
Class constrained bin packing revisited
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
ORL
2007
96views more  ORL 2007»
13 years 5 months ago
A note on scenario reduction for two-stage stochastic programs
We extend earlier work on scenario reduction by relying directly on Fortet–Mourier metrics instead of using upper bounds given in terms of mass transportation problems. The impo...
Holger Heitsch, Werner Römisch
TIT
2002
107views more  TIT 2002»
13 years 5 months ago
Constrained systems with unconstrained positions
We develop methods for analyzing and constructing combined modulation/error-correctiong codes (ECC codes), in particular codes that employ some form of reversed concatenation and w...
Jorge Campello de Souza, Brian H. Marcus, Richard ...
OL
2008
61views more  OL 2008»
13 years 5 months ago
Note on Mond-Weir type nondifferentiable second order symmetric duality
In this paper, we point out some inconsistencies in the earlier work of Ahmad and Husain (Appl. Math. Lett. 18, 721
Z. Husain, I. Ahmad
KES
2008
Springer
13 years 5 months ago
IRPS - An Efficient Test Data Generation Strategy for Pairwise Testing
Software testing is an integral part of software engineering. Lack of testing often leads to disastrous consequences including loss of data, fortunes, and even lives. In order to e...
Mohammed I. Younis, Kamal Zuhairi Zamli, Nor Ashid...
COR
2006
96views more  COR 2006»
13 years 5 months ago
Scheduling two parallel machines with a single server: the general case
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan
IPCO
1990
76views Optimization» more  IPCO 1990»
13 years 6 months ago
Probabilistic Analysis of the Generalised Assignment Problem
We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We show that such problems can be solved...
Martin E. Dyer, Alan M. Frieze
CIKM
2008
Springer
13 years 7 months ago
Natural language retrieval of grocery products
In this paper we describe modifications to a natural language grocery retrieval system, introduced in our earlier work. We also compare our system against an off-the-shelf retriev...
Petteri Nurmi, Eemil Lagerspetz, Wray L. Buntine, ...
INFOCOM
1997
IEEE
13 years 9 months ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk