Sciweavers

1672 search results - page 179 / 335
» Tightness problems in the plane
Sort
View
ESA
2006
Springer
126views Algorithms» more  ESA 2006»
15 years 2 months ago
Cooperative TSP
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...
Amitai Armon, Adi Avidor, Oded Schwartz
ICALP
2000
Springer
15 years 2 months ago
Efficient Verification Algorithms for One-Counter Processes
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
Antonín Kucera
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 1 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 19 days ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
AIPS
1996
15 years 17 days ago
TRAINS-95: Towards a Mixed-Initiative Planning Assistant
We have been examining mixed-initiative planning systems in the context of command and control or logistical overview situations. In such environments, the human and the computer ...
George Ferguson, James F. Allen, Bradford W. Mille...