Results 1  10
of
216,610
On Approximating a Geometric PrizeCollecting Traveling Salesman Problem with Time Windows
, 2003
"... We study a scheduling problem in which jobs have locations. For example, consider a repairman that is supposed to visit customers at their homes. Each customer is given a time window during which the repairman is allowed to arrive. The goal is to find a schedule that visits as many homes as possi ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
as possible. We refer to this problem as the PrizeCollecting Traveling Salesman Problem with time windows (TWTSP).
Approximations of geometric prizecollecting traveling salesman problem with time windows
"... We present in this note a result by authors Reuven BarYehuda, Guy Even, and Shimon Shahar who consider a scheduling problem in which jobs have locations. For example, consider a repairman that is supposed to visit customers at their homes. Each customer is given a time window during which the repai ..."
Abstract
 Add to MetaCart
the repairman is allowed to arrive. The goal is to nd a schedule that visits as many homes as possible. This problem is referred to as the prizecollecting traveling salesman problem with time windows (TWTSP). Two versions of TWTSP are considered. In the rst version, jobs are located on a line, have release
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
 In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS’96
, 1996
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c � 1 and given any n nodes in � 2, a randomized version of the scheme finds a (1 � 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes a ..."
Abstract

Cited by 399 (3 self)
 Add to MetaCart
Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c � 1 and given any n nodes in � 2, a randomized version of the scheme finds a (1 � 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Possessions and the Extended Self
 Journal of Consumer Research
, 1988
"... Our possessions are a major contributor to and reflection of our identities. A variety of evidence is presented supporting this simple and compelling premise. Related streans of research are identified and drawn upon in devetopJng this concept and implications are derived for consumer behavior. Beca ..."
Abstract

Cited by 544 (2 self)
 Add to MetaCart
Our possessions are a major contributor to and reflection of our identities. A variety of evidence is presented supporting this simple and compelling premise. Related streans of research are identified and drawn upon in devetopJng this concept and implications are derived for consumer behavior
Improved Approximation Algorithms for the Minimum Latency Problem via PrizeCollecting Strolls
"... The minimum latency problem (MLP) is a wellstudied variant of the traveling salesman problem (TSP). In the MLP, the server’s goal is to minimize the average latency that the clients experience prior to being served, rather than the total latency experienced by the server (as in the TSP). The MLP so ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Chaudhuri et al., 2003). In this paper, we improve the approximation ratio for trees to 3.03. In fact, our 3.03approximation algorithm works for any class of graphs in which the related prizecollecting stroll (PCS) problem is solvable in polynomial time, such as graphs of constant treewidth. More
A Scheme for RealTime Channel Establishment in WideArea Networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1990
"... Multimedia communication involving digital audio and/or digital video has rather strict delay requirements. A realtime channel is defined in this paper as a simplex connection between a source and a destination characterized by parameters representing the performance requirements of the client. A r ..."
Abstract

Cited by 710 (31 self)
 Add to MetaCart
Multimedia communication involving digital audio and/or digital video has rather strict delay requirements. A realtime channel is defined in this paper as a simplex connection between a source and a destination characterized by parameters representing the performance requirements of the client. A
An Hybrid GRASP+VNS Metaheuristic for the PrizeCollecting Traveling Salesman Problem
"... : In the PrizeCollecting Traveling Salesman Problem (PCTSP) we have to determine a tour visiting each vertex in the graph at most one time. If a given vertex is selected then an associated prize is collected, if a vertex is unrouted a penalty must be paid. We want to minimize an objective functi ..."
Abstract
 Add to MetaCart
: In the PrizeCollecting Traveling Salesman Problem (PCTSP) we have to determine a tour visiting each vertex in the graph at most one time. If a given vertex is selected then an associated prize is collected, if a vertex is unrouted a penalty must be paid. We want to minimize an objective
Semantic Similarity in a Taxonomy: An InformationBased Measure and its Application to Problems of Ambiguity in Natural Language
, 1999
"... This article presents a measure of semantic similarityinanisa taxonomy based on the notion of shared information content. Experimental evaluation against a benchmark set of human similarity judgments demonstrates that the measure performs better than the traditional edgecounting approach. The a ..."
Abstract

Cited by 601 (9 self)
 Add to MetaCart
. The article presents algorithms that take advantage of taxonomic similarity in resolving syntactic and semantic ambiguity, along with experimental results demonstrating their e#ectiveness. 1. Introduction Evaluating semantic relatedness using network representations is a problem with a long history
Results 1  10
of
216,610