Sciweavers

14739 search results - page 278 / 2948
» An optimization problem on the sphere
Sort
View
COCOA
2008
Springer
15 years 1 months ago
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
Gerold Jäger, Paul Molitor
AIPS
2006
15 years 20 days ago
Resource Contention Metrics for Oversubscribed Scheduling Problems
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
Laurence A. Kramer, Stephen F. Smith
FOCS
2008
IEEE
14 years 11 months ago
Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...
Maurice Cheung, Chaitanya Swamy
IPL
2008
61views more  IPL 2008»
14 years 11 months ago
Online chasing problems for regular polygons
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...
Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa
JACM
2006
92views more  JACM 2006»
14 years 11 months ago
The generalized two-server problem
We consider the generalized on-line two-server problem in which at each step each server receives a request, which is a point in a metric space. One of the servers has to be moved ...
René A. Sitters, Leen Stougie