Results 1 - 10
of
85
Reusing optimal TSP solutions for locally modified input instances
- In Proc. Fourth IFIP International Conference on Theoretical Computer Science (TCS
, 2006
"... Abstract. Given an instance of an optimization problem together with an optimal solution, we consider the scenario in which this instance is modified locally. In graph problems, e. g., a singular edge might be removed or added, or an edge weight might be varied, etc. For a problem U and such a local ..."
Abstract
-
Cited by 10 (5 self)
- Add to MetaCart
Abstract. Given an instance of an optimization problem together with an optimal solution, we consider the scenario in which this instance is modified locally. In graph problems, e. g., a singular edge might be removed or added, or an edge weight might be varied, etc. For a problem U and such a
On the Approximability of TSP on Local Modifications of Optimally Solved Instances
"... Given an instance of TSP together with an optimal solution, we consider the scenario in which this instance is modified locally, where a local modification consists in the alteration of the weight of a single edge. More generally, for a problem U, let LM-U (local-modification-U) denote the same prob ..."
Abstract
- Add to MetaCart
Given an instance of TSP together with an optimal solution, we consider the scenario in which this instance is modified locally, where a local modification consists in the alteration of the weight of a single edge. More generally, for a problem U, let LM-U (local-modification-U) denote the same
Reoptimization of the Metric Deadline TSP (Extended Abstract)
, 2008
"... The reoptimization version of an optimization problem deals with the following scenario: Given an input instance together with an optimal solution for it, the objective is to find a high-quality solution for a locally modified instance. In this paper, we investigate several reoptimization variants ..."
Abstract
- Add to MetaCart
The reoptimization version of an optimization problem deals with the following scenario: Given an input instance together with an optimal solution for it, the objective is to find a high-quality solution for a locally modified instance. In this paper, we investigate several reoptimization variants
Approximation Hardness of the Traveling Salesman Reoptimization Problem
, 2007
"... In TSP reoptimization, a complete weighted graph and an optimal Hamiltonian tour are given; the problem is to find an optimal solution for a locally modified input. In this paper, we consider the local modification where one edge of the graph becomes cheaper. We show that the best approximation rati ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
In TSP reoptimization, a complete weighted graph and an optimal Hamiltonian tour are given; the problem is to find an optimal solution for a locally modified input. In this paper, we consider the local modification where one edge of the graph becomes cheaper. We show that the best approximation
CERTIFICATE OF APPROVAL
, 2014
"... Treatment plan optimization for rotating-shield brachytherapy ..."
DOI 10.1007/s00778-012-0302-x SPECIAL ISSUE PAPER Automating the database schema evolution process
"... Abstract Supporting database schema evolution repre-sents a long-standing challenge of practical and theoretical importance for modern information systems. In this paper, we describe techniques and systems for automating the critical tasks of migrating the database and rewriting the legacy applicati ..."
Abstract
- Add to MetaCart
legacy queries and updates under schema and integrity constraints evolution. The PRISM/PRISM++ approach consists in providing the users with a set of SQL-based Schema Modification Opera-tors (SMOs), which describe how the tables in the old schema are modified into those in the new schema. In order to sup
22.10.2009 Implementation of a Peer-to-Peer Multiplayer Game with Realtime Requirements
"... Massively multiplayer online games (MMOGs) have become increasingly popular in the recent years, particularly in the form of online role-playing games (MMORPGs). These games support up to several ten thousand players interacting in a virtual game world. The current commercially successful games are ..."
Abstract
- Add to MetaCart
is selected for implementation with Planet π4. Planet π4 is improved in several aspects for the purpose of analyzing various network implementations. First, its architecture is restructured and cleaned to allow for an easy replacement of the networking component. Second, its core is modified to work in a
Guaranteeing Communication Quality in Real World WSN Deployments
"... April 29, 2011Für UnsShe had never before seen a rabbit with either a waistcoat-pocket, or a watch to take out of it, and burning with curiosity, she ran across the field after it Lewis CarrollThe following document, written under the supervision of Dr. reviewed by: ..."
Abstract
- Add to MetaCart
April 29, 2011Für UnsShe had never before seen a rabbit with either a waistcoat-pocket, or a watch to take out of it, and burning with curiosity, she ran across the field after it Lewis CarrollThe following document, written under the supervision of Dr. reviewed by:
Results 1 - 10
of
85