Search Results - Combinatorics and discrete structures related to algorithms

Optimal Join Algorithms Meet Top- k by Tziavelis, Nikolaos, Gatterbauer, Wolfgang, Riedewald, Mirek

“… While some optimality results exist, e.g., the famous Threshold Algorithm, they hold only in a fairly limited model of computation that does not account for the cost incurred by large intermediate results and hence is not aligned…”
Get more information

Kernel bounds for disjoint cycles and disjoint paths by Bodlaender, Hans L., Thomassé, Stéphan, Yeo, Anders

“…In this paper, we show that the problems Disjoint Cycles and Disjoint Paths do not have polynomial kernels, unless N P ⊆ c o N P / p o l y . Thus, these…”
Get full text

A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis by Gély, Alain, Couceiro, Miguel, Miclet, Laurent, Napoli, Amedeo

“…In this paper, we study structures such as distributive lattices, distributive semilattices, and median graphs from an algorithmic point of view…”
Get full text

The RED-BLUE SEPARATION problem on graphs by Dev, Subhadeep Ranjan, Dey, Sanjana, Foucaud, Florent, Klasing, Ralf, Lehtilä, Tuomo

“…We introduce the Red-Blue Separation problem on graphs, where we are given a graph G=(V,E) whose vertices are colored either red or blue, and we want to select…”
Get full text

First-order logic axiomatization of metric graph theory by Chalopin, Jérémie, Changat, Manoj, Chepoi, Victor, Jacob, Jeny

“…The main goal of this note is to provide a First-Order Logic with Betweenness (FOLB) axiomatization of the main classes of graphs occurring in Metric Graph…”
Get full text

Enumeration of irredundant forests by Ingels, Florian, Azaïs, Romain

“…Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining…”
Get full text

Endhered Patterns in Matchings and RNA by Biane, Célia, Hampikian, Greg, Kirgizov, Sergey, Nurligareev, Khaydar

“…) RNA structures with pseudoknots. We present combinatorial results related to the distribution and asymptotic behavior of the pattern 21, which corresponds to two consecutive base pairs frequently encountered in RNA, and the pattern…”
Get more information

Faster parameterized algorithms for minor containment by Adler, Isolde, Dorn, Frederic, Fomin, Fedor V., Sau, Ignasi, Thilikos, Dimitrios M.

“… The derivation of a polynomial-time algorithm for H - Minor containment is one of the most important and technical parts of the Graph Minor Theory of Robertson and Seymour and it is…”
Get full text

Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms by Bourgeois, Nicolas, Escoffier, Bruno, Paschos, Vangelis Th

“…Using ideas and results from polynomial time approximation and exact computation we design approximation algorithms for several NP-hard combinatorial problems achieving ratios that cannot be achieved in polynomial time…”
Get full text

On the heapability of finite partial orders by Balogh, János, Bonchiş, Cosmin, Diniş, Diana, Istrate, Gabriel, Todinca, Ioan

“… We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing such a minimal decomposition…”
Get full text

Synchronizing production planning and job scheduling: MILP models and exact algorithms by Mombelli, Aurélien, Quilliot, Alain

“…We address the synchronization of a resource production process with the consumption of related resources by jobs…”
Get full text

Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems by Iwasa, Masaru, Saito, Hiroo, Matsui, Tomomi

“…This paper deals with a single allocation problem in hub-and-spoke networks. We present a simple deterministic 3-approximation algorithm and randomized…”
Get full text

The Implementation of the Colored Abstract Simplicial Complex and its Application to Mesh Generation by Lee, Christopher T, Moody, John B, Amaro, Rommie E, McCammon, J Andrew, Holst, Michael J

“… We present the innovations and design principles of the data structure and related algorithms…”
Get more information

Complexity results related to monophonic convexity by Dourado, Mitre C., Protti, Fábio, Szwarcfiter, Jayme L.

“…The study of monophonic convexity is based on the family of induced paths of a graph. The closure of a subset X of vertices, in this case, contains every…”
Get full text

Aspects of predication and their influence on reasoning about logic in discrete mathematics by Dawkins, Paul Christian, Roh, Kyeong Hah

“… We argue these are consequential for how students make sense of discrete mathematics proofs related to the properties and how they construct a logical structure…”
Get full text

Lattice paths with catastrophes by Banderier, Cyril, Wallner, Michael

“… Furthermore, we prove several formulae for related combinatorial structures conjectured in the On-Line Encyclopedia of Integer Sequences. Thanks to the kernel method and via analytic combinatorics, we provide the enumeration and limit laws of these "lattice paths with catastrophes" for any finite set of jumps. We end with an algorithm to generate such lattice paths uniformly at random. Comment: 32 pages…”
Get full text

Open problems around exact algorithms by Woeginger, Gerhard J.

“… We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature…”
Get full text

Deletion in Abstract Voronoi Diagrams in Expected Linear Time and Related Problems by Junginger, Kolja, Papadopoulou, Evanthia

“…; similarly, for any concrete Voronoi diagram of generalized (non-point) sites. In this paper we present a simple, expected linear-time algorithm to update an abstract Voronoi diagram after deletion of one site…”
Get full text

Efficient pricing of discrete Asian options by Hsu, William W.Y., Lyuu, Yuh-Dauh

“… The algorithm proposed can also be applied to floating-strike Asian options as well because fixed-strike and floating-strike Asian options are related through an equation…”
Get full text

Risk prediction of hypertension complications based on the intelligent algorithm optimized Bayesian network by Du, Gang, Liang, Xi, Ouyang, Xiaoling, Wang, Chunming

“… of hypertension complications by text mining. On this basis, the K2 algorithm based on the improved particle swarm optimization was proposed to optimize the structure of the Bayesian network (BN…”
Get full text