Sciweavers

87 search results - page 10 / 18
» arcs 2004
Sort
View
WAOA
2004
Springer
91views Algorithms» more  WAOA 2004»
14 years 25 days ago
Pricing Network Edges to Cross a River
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
Alexander Grigoriev, Stan P. M. van Hoesel, Anton ...
CAD
2004
Springer
13 years 7 months ago
Curve fitting and fairing using conic splines
We present an efficient geometric algorithm for conic spline curve fitting and fairing through conic arc scaling. Given a set of planar points, we first construct a tangent contin...
Xunnian Yang
MFCS
2004
Springer
14 years 25 days ago
Generating Paths and Cuts in Multi-pole (Di)graphs
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
CPM
2004
Springer
87views Combinatorics» more  CPM 2004»
14 years 26 days ago
A Trie-Based Approach for Compacting Automata
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
Maxime Crochemore, Chiara Epifanio, Roberto Grossi...
ICCS
2004
Springer
14 years 26 days ago
On Algorithm for All-Pairs Most Reliable Quickest Paths
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
Young-Cheol Bang, Inki Hong, Hyunseung Choo