Sciweavers

87 search results - page 9 / 18
» Solving large Steiner Triple Covering Problems
Sort
View
DCOSS
2011
Springer
12 years 7 months ago
STARS: Static relays for multi-robot real-time search and monitoring
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
Yuanteng Pei, Matt W. Mutka
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
MP
2006
138views more  MP 2006»
13 years 7 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
HICSS
2003
IEEE
115views Biometrics» more  HICSS 2003»
14 years 28 days ago
Design and Implementation of a Bridge between CORBA's Notification Service and the Java Message Service
Messaging plays a central role in the development of distributed object-oriented systems. It is supported by the specification of the Java Message Service (JMS) and CORBA’s Noti...
Markus Aleksy, Martin Schader, Alexander Schnell
RECOMB
2004
Springer
14 years 8 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp