Sciweavers

214 search results - page 14 / 43
» A linear time algorithm for L(2,1)-labeling of trees
Sort
View
ACTA
2000
302views more  ACTA 2000»
14 years 10 months ago
Efficiently building a parse tree from a regular expression
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
Danny Dubé, Marc Feeley
SODA
2003
ACM
133views Algorithms» more  SODA 2003»
14 years 11 months ago
Integrality ratio for group Steiner trees and directed steiner trees
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
SODA
2004
ACM
108views Algorithms» more  SODA 2004»
14 years 11 months ago
A certifying algorithm for the consecutive-ones property
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
Ross M. McConnell
69
Voted
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 7 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
IWSEC
2010
Springer
14 years 8 months ago
Optimal Adversary Behavior for the Serial Model of Financial Attack Trees
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
Margus Niitsoo