Sciweavers

15485 search results - page 335 / 3097
» Computing Optimal Subsets
Sort
View
FCT
1995
Springer
15 years 10 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
BIRTHDAY
2008
Springer
15 years 8 months ago
Church's Problem and a Tour through Automata Theory
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
Wolfgang Thomas
CMSB
2008
Springer
15 years 8 months ago
Compositional Definitions of Minimal Flows in Petri Nets
Abstract. This paper gives algebraic definitions for obtaining the minimal transition and place flows of a modular Petri net from the minimal transition and place flows of its comp...
Michael Pedersen
EOR
2010
219views more  EOR 2010»
15 years 6 months ago
The Attractive Traveling Salesman Problem
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
Günes Erdogan, Jean-François Cordeau, ...
COMGEO
2007
ACM
15 years 6 months ago
Delaunay triangulations approximate anchor hulls
Recent results establish that a subset of the Voronoi diagram of a point set that is sampled from the smooth boundary of a shape approximates the medial axis. The corresponding qu...
Tamal K. Dey, Joachim Giesen, Samrat Goswami