Filters








23 Hits in 5.0 sec

Parameterized Complexity of Fair Vertex Evaluation Problems [article]

Dušan Knop, Tomáš Masařík, Tomáš Toufar
2019 arXiv   pre-print
On the negative side, Fair VC is W[1]-hard when parameterized by both treedepth and feedback vertex set of the input graph.  ...  A prototypical graph problem is centered around a graph theoretic property for a set of vertices and a solution is a set of vertices for which the desired property holds.  ...  Integer linear programming with objective minimization of a separable convex function in dimension p is FPT with respect to p and space exponential in L the length of encoding of the ILP instance.  ... 
arXiv:1803.06878v3 fatcat:zju2tkfs2rdobb7jtu7exshjcy

Ramsey Theory Applications

Vera Rosta
2004 Electronic Journal of Combinatorics  
Relations of Ramsey-type theorems to various fields in mathematics are well documented in published books and monographs.  ...  There are many interesting applications of Ramsey theory, these include results in number theory, algebra, geometry, topology, set theory, logic, ergodic theory, information theory and theoretical computer  ...  Acknowledgment I am grateful to Noga Alon for encouragements and fruitful suggestions. I also thank Gyula Károlyi for helpful comments.  ... 
doi:10.37236/34 fatcat:gxrfo23hzzewjg7rez76d4xx4i

Minimum color‐degree perfect b ‐matchings

Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs
2020 Networks  
Schrader, and Graphs III (Wed 20, Room PP, 9:30-10:30) chaired by R. Cordone. Session chairs must remind speakers to load up slides on laptops, and keep the sessions on time.  ...  Session chairs are encouraged to be cruel and despotic as regards times allotted, since there are parallel sessions.  ...  We wish to mention that also the familiar branch-and-bound algorithm for mixedinteger linear programming (again using (D I ) as a starting point) can also be nicely reworked to fit in the column-generation  ... 
doi:10.1002/net.21974 fatcat:4qgtutmxrrcy7anvxks4fivcii

Dependent Random Choice [article]

Jacob Fox, Benny Sudakov
2010 arXiv   pre-print
We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small subsets have many common  ...  Recently this technique has had several striking applications to Extremal Graph Theory, Ramsey Theory, Additive Combinatorics, and Combinatorial Geometry. In this survey we discuss some of them.  ...  We would like to thank David Conlon, Jacques Verstraëte, Jan Hladký, and the anonymous referees for carefully reading this manuscript and helpful comments.  ... 
arXiv:0909.3271v2 fatcat:affwyxeo7jeehpqdmtgz335ksy

Dependent random choice

Jacob Fox, Benny Sudakov
2010 Random structures & algorithms (Print)  
Early versions of this technique were proved and applied by various researchers, starting with Rödl, Gowers, Kostochka, and Sudakov (see [60] , [49] , [81] ).  ...  We will usually not give the arguments which lead to the best known results or the sharpest possible bounds, but rather concentrate on explaining the main ideas which we believe have wide applicability  ...  We would like to thank David Conlon, Jacques Verstraëte, Jan Hladký, and the anonymous referees for carefully reading this manuscript and helpful comments.  ... 
doi:10.1002/rsa.20344 fatcat:dxbkbxepprefnefyesa7jcmsye

Anomaly Detection and Correction in Large Labeled Bipartite Graphs [article]

R. W. R. Darling, Mark L. Velednitsky
2018 arXiv   pre-print
These algorithms range from math programming algorithms to discrete combinatorial algorithms to Bayesian approximation algorithms to machine learning algorithms.  ...  We consider the case of labeled bipartite graphs in which some labels and edges are not trustworthy. Our goal is to reduce noise by identifying and fixing these labels and edges.  ...  Formulation 5.1 Background Semi-Definite Programming is a special case of Convex Programming.  ... 
arXiv:1811.04483v1 fatcat:znqokmyl25a2zepkqjjfsy43sm

Community detection and stochastic block models: recent developments [article]

Emmanuel Abbe
2017 arXiv   pre-print
The note also covers some of the algorithms developed in the quest of achieving the limits, in particular two-round algorithms via graph-splitting, semi-definite programming, linearized belief propagation  ...  and data sciences.  ...  Zdeborova, as well as the various colleagues, students and anonymous reviewers who gave comments on the earlier drafts.  ... 
arXiv:1703.10146v1 fatcat:fxbi227nqna4xiugshm5jbpdna

Geographic Data Processing

George Nagy, Sharad Wagle
1979 ACM Computing Surveys  
This survey attempts to provide a umfied framework for the constituent elements-originating In numerous and diverse disciplines--of geographical data processing systems.  ...  , command and interaction, documentation, and administration.The internal aspects, which would concern the system designer, are analyzed in terms of the type of spatial variables involved and of their  ...  This option can, therefore, be used to produce "neighborhood" maps.  ... 
doi:10.1145/356770.356777 fatcat:tllytdkujrhjzjgo7fwreunolq

Cognitive Constructivism and the Epistemic Significance of Sharp Statistical Hypotheses in Natural Sciences [article]

J.M. Stern
2020 arXiv   pre-print
This book presents our case in defense of a constructivist epistemological framework and the use of compatible statistical theory and inference tools.  ...  This metaphor has proven to be very useful, leading the development of Bayesian statistics since its XX-th century revival, rooted on the work of de Finetti, Savage and others.  ...  Theorem: Polyhedra are convex, but not necessarily bounded.  ... 
arXiv:1006.5471v7 fatcat:6hxzvbaxmrd7flumtv6xkud6lm

Algorithmic aspects of manipulation and anonymization in social choice and social networks [article]

Nimrod Talmon, Rolf Niedermeier, Technische Universität Berlin, Technische Universität Berlin
2016
This thesis presents a study of several combinatorial problems related to social choice and social networks.  ...  The problems discussed in Chapter 3 and in Chapter 4 are about manipulating a given election, where some relationships between the entities of the election are assumed.  ...  I would like to thank Rolf Niedermeier for providing guidance and good atmosphere for research.  ... 
doi:10.14279/depositonce-4941 fatcat:tadeijt4ejhtlc3kwvhxykfmwe

Exploring parameter spaces in coping with computational intractability [article]

Sepp Hartung, Rolf Niedermeier, Technische Universität Berlin, Technische Universität Berlin
2014
Hence they pave the way for a systematic and clear analysis of computational complexity and they help to chart the "border of intractability".  ...  The first approach is tuned for graph problems and suggests to consider the computationa [...]  ...  In this way we take a closer look at parameterization aspects that help in better understanding and exploiting problem-specific properties.  ... 
doi:10.14279/depositonce-3922 fatcat:ynttmtrybfh2xbdcw3ot7zw43a

Fifty years of entropy in dynamics: 1958--2007

Anatole Katok
2007 Journal of Modern Dynamics  
historical" nature including allusions to certain episodes and discussion of attitudes and contributions of various participants.  ...  I recommend the book [59] as a source of background reading and the survey [44] (both written jointly with Boris Hasselblatt) as a reference source for virtually all necessary definitions and (hopefully  ...  is bounded, the code is called finite.  ... 
doi:10.3934/jmd.2007.1.545 fatcat:6muz4yjqdvas3c7thlvqgv4h6y

From Euclid to Riemann and Beyond [article]

Toshikazu Sunada
2019 arXiv   pre-print
I am also grateful to Athanase Papadopoulos, Ken'ichi Ohshika, and Polly Wee Sy for the careful reading and for all their invaluable comments and suggestions to the enlarged version.  ...  handle diverse problems in sciences.  ...  Finiteness of a figure in R N is interpreted by the terms closed and bounded.  ... 
arXiv:1904.01845v1 fatcat:tyckpaulw5agfbzj7zelbk5htm

Putting Data on the Map (Dagstuhl Seminar 12261)

Katarzyna Wac, David Hausheer, Markus Fiedler, Paolo Bonato, Michael Fellows, Jiong Guo, Dániel Marx, Saket, Stephen Kobourov, Alexander Wolff, Frank Van, Ham
2012 unpublished
Namely, either the sum of all displacements, the maximum displacement and the number of transpositions. We call the corresponding problems TotalDisplacement, MinMaxDisplacement and MinTranspositions.  ...  We showed that using approaches similar to the one for LinearArrangement [1], one can obtain efficient algorithms for all three problems on balanced bounded-degree trees.  ...  Quadratic Integer Programming Daniel Lokshtanov (University of California -San Diego, US) 27 Dániel Marx and Igor Razgon.  ... 
fatcat:4gqqymbpeffodcqcliwkxfzr6i

Problems of unknown complexity : graph isomorphism and Ramsey theoretic numbers [article]

Pascal Schweitzer, Universität Des Saarlandes, Universität Des Saarlandes
2009
Finally, I am greatly in debt and most thankful to my brother Patrick Schweitzer, who persistently improved the quality of my dissertation in virtually every aspect.  ...  Bounds for Ramsey numbers have been established by reformulating the problem into an integer program. Current solvers for these integer programs have become very fast.  ...  Erikson [38] uses a dynamic programming approach to obtain an algorithm that computes the longest arithmetic progression within a set of n integers in O(n 2 ) time.  ... 
doi:10.22028/d291-25946 fatcat:ff66x4zhlzaghlr4visddjomkq
« Previous Showing results 1 — 15 out of 23 results