𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sharp Separation and Applications to Exact and Parameterized Algorithms

✍ Scribed by Fedor V. Fomin; Fabrizio Grandoni; Daniel Lokshtanov; Saket Saurabh

Publisher
Springer
Year
2011
Tongue
English
Weight
562 KB
Volume
63
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parameterized Pattern Matching: Algorith
Parameterized Pattern Matching: Algorithms and Applications
✍ Brenda S. Baker πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 416 KB

The problem of finding sections of code that either are identical or are related by the systematic renaming of variables or constants can be modeled in terms of parameterized strings ( p-strings) and parameterized matches ( p-matches). P-strings are strings over two alphabets, one of which represent

Sharp discrete inequalities and applicat
Sharp discrete inequalities and applications to discrete variational problems
✍ Wing-Sum Cheung πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 497 KB

Some new discrete inequalities involving monotonic or convex functions are obtained. While these are interesting inequalities in their own right, they can be applied to solving certain types of discrete variational problems effectively.

Fast and robust algorithm to compute exa
Fast and robust algorithm to compute exact polytope parameter bounds
✍ S.H. Mo; J.P. Norton πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 862 KB

When bounds on the parameters of a linear-in-the-parameters model are computed, the exact feasible parameter set defined by the bounds (a polytope) is usually approximated by a simpler shape such as an ellipsoid. However, such simpler bounds may be much looser than the exact bounds. A new algorithm