Search results for "Polymatroids"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
100	Oriol Farràs, Jaume Martí-Farré, Carles Padró	Ideal Multipartite Secret Sharing Schemes.	EUROCRYPT	2007	DBLP DOI BibTeX RDF	Ideal access structures, Multipartite secret sharing, Multipartite matroids, Discrete polymatroids, Secret sharing, Ideal secret sharing schemes
53	Jaume Martí-Farré, Carles Padró	On Secret Sharing Schemes, Matroids and Polymatroids.	TCC	2007	DBLP DOI BibTeX RDF	Ideal access structures, Secret sharing, Matroids, Ideal secret sharing schemes, Information rate, Polymatroids
29	Alessandro Agnetis, Paolo Detti, Marco Pranzo, Manbir Singh Sodhi	Sequencing unreliable jobs on parallel machines.	J. Sched.	2009	DBLP DOI BibTeX RDF	Indexable problems, Unsupervised manufacturing systems, Approximation algorithms, NP-hardness, Polymatroids
29	Natalia V. Shakhlevich, Vitaly A. Strusevich	Pre-Emptive Scheduling Problems with Controllable Processing Times.	J. Sched.	2005	DBLP DOI BibTeX RDF	bicriteria problems, greedy algorithms, single machine scheduling, parallel machine scheduling, polymatroids, controllable processing times
24	Eimear Byrne, Michela Ceria, Sorina Ionica, Relinde P. M. J. Jurrius	Weighted Subspace Designs from q-Polymatroids.	J. Comb. Theory, Ser. A	2024	DBLP DOI BibTeX RDF
24	William Gustafson	Polymatroids, Closure Operators and Lattices.	Order	2023	DBLP DOI BibTeX RDF
24	Joseph E. Bonin, Kevin Long	The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids.	SIAM J. Discret. Math.	2023	DBLP DOI BibTeX RDF
24	Jean Cardinal, Raphael Steiner	Shortest paths on polymatroids and hypergraphic polytopes.	CoRR	2023	DBLP DOI BibTeX RDF
24	Gianira N. Alfarano, Eimear Byrne	The Critical Theorem for q-Polymatroids.	CoRR	2023	DBLP DOI BibTeX RDF
24	Mieczyslaw Kula	Access structures induced by polymatroids with extreme rank function.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
24	Joseph E. Bonin, Carolyn Chun, Tara Fife	The Excluded Minors for Lattice Path Polymatroids.	Electron. J. Comb.	2022	DBLP DOI BibTeX RDF
24	Vijay V. Vazirani	Cores of Games via Total Dual Integrality, with Applications to Perfect Graphs and Polymatroids.	CoRR	2022	DBLP DOI BibTeX RDF
24	Hiroshi Imai, Keiko Imai, Hidefumi Hiraishi	Extended formulations of lower-truncated transversal polymatroids.	Optim. Methods Softw.	2021	DBLP DOI BibTeX RDF
24	Heide Gluesing-Luerssen, Benjamin Jany	Independent Spaces of q-Polymatroids.	CoRR	2021	DBLP BibTeX RDF
24	Heide Gluesing-Luerssen, Benjamin Jany	q-Polymatroids and Their Relation to Rank-Metric Codes.	CoRR	2021	DBLP BibTeX RDF
24	Amir K. Khandani	Achieving Capacity Region of 2-users Weak GIC by Enlarging the Core in a Nested Set of Polymatroids (continuation of arXiv: 2012.07820 "Optimality of Gaussian in Enlarging HK Rate Region, and its Overlap with ...").	CoRR	2021	DBLP BibTeX RDF
24	Hakan Kutucu	Bases of polymatroids and problems on graphs.	Turkish J. Electr. Eng. Comput. Sci.	2020	DBLP DOI BibTeX RDF
24	László Csirmaz	One-adhesive polymatroids.	Kybernetika	2020	DBLP DOI BibTeX RDF
24	Terence H. Chan, Qi Chen 0001, Raymond W. Yeung	Characterisation of conditional independence structures for polymatroids using vanishing sets.	Kybernetika	2020	DBLP DOI BibTeX RDF
24	Joseph E. Bonin, Carolyn Chun	Decomposable polymatroids and connections with graph coloring.	Eur. J. Comb.	2020	DBLP DOI BibTeX RDF
24	Renata Kawa, Mieczyslaw Kula	Access Structures Determined by Uniform Polymatroids.	CoRR	2020	DBLP BibTeX RDF
24	Anoop Thomas, Balaji Sundar Rajan	Generalized Index Coding Problem and Discrete Polymatroids.	Entropy	2020	DBLP DOI BibTeX RDF
24	James G. Oxley, Charles Semple, Geoff Whittle	A Splitter Theorem for 3-Connected 2-Polymatroids.	Electron. J. Comb.	2019	DBLP DOI BibTeX RDF
24	László Csirmaz	Sticky polymatroids on at most five elements.	CoRR	2019	DBLP BibTeX RDF
24	Kristóf Bérczi, André Berger, Matthias Mnich, Roland Vincze	Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP.	CoRR	2019	DBLP BibTeX RDF
24	László Csirmaz	One-adhesive polymatroids.	CoRR	2019	DBLP BibTeX RDF
24	Dennis Hall	Unavoidable minors for connected 2-polymatroids.	J. Comb. Theory, Ser. B	2019	DBLP DOI BibTeX RDF
24	Tobias Harks, Max Klimm, Britta Peis	Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids.	SIAM J. Optim.	2018	DBLP DOI BibTeX RDF
24	Elisa Gorla, Relinde P. M. J. Jurrius, Hiram H. López, Alberto Ravagnani	Rank-Metric Codes and q-Polymatroids.	CoRR	2018	DBLP BibTeX RDF
24	Anoop Thomas, B. Sundar Rajan	Generalized Index Coding Problem and Discrete Polymatroids.	CoRR	2017	DBLP BibTeX RDF
24	Anoop Thomas, B. Sundar Rajan	Generalized index coding problem and discrete polymatroids.	ISIT	2017	DBLP DOI BibTeX RDF
24	Susan Jowett, Songbao Mo, Geoff Whittle	Connectivity functions and polymatroids.	Adv. Appl. Math.	2016	DBLP DOI BibTeX RDF
24	James G. Oxley, Charles Semple, Geoff Whittle	A Wheels-and-Whirls Theorem for 3-Connected 2-Polymatroids.	SIAM J. Discret. Math.	2016	DBLP DOI BibTeX RDF
24	Vijayvaradharaj Tirucherai Muralidharan, B. Sundar Rajan	Linear Network Coding, Linear Index Coding and Representable Discrete Polymatroids.	IEEE Trans. Inf. Theory	2016	DBLP DOI BibTeX RDF
24	Tobias Harks, Max Klimm, Britta Peis	Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids.	CoRR	2016	DBLP BibTeX RDF
24	Jayant Apte, John MacLaren Walsh	Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding.	CoRR	2016	DBLP BibTeX RDF
24	Yujue Wang, Qianhong Wu, Duncan S. Wong, Bo Qin, Yi Mu 0001, Jianwei Liu 0001	Further ideal multipartite access structures from integer polymatroids.	Sci. China Inf. Sci.	2015	DBLP DOI BibTeX RDF
24	Anoop Thomas, B. Sundar Rajan	Vector Linear Error Correcting Index Codes and Discrete Polymatroids.	CoRR	2015	DBLP BibTeX RDF
24	Anoop Thomas, B. Sundar Rajan	Vector linear error correcting index codes and discrete polymatroids.	ISIT	2015	DBLP DOI BibTeX RDF
24	Amir Salimi, Muriel Médard, Shuguang Cui	On the representability of integer polymatroids: Applications in linear code construction.	Allerton	2015	DBLP DOI BibTeX RDF
24	Thomas J. Savitsky	Enumeration of 2-Polymatroids on up to Seven Elements.	SIAM J. Discret. Math.	2014	DBLP DOI BibTeX RDF
24	Tobias Harks, Max Klimm, Britta Peis	Resource Competition on Integral Polymatroids.	CoRR	2014	DBLP BibTeX RDF
24	Jean François Maurras, Ingo Spiegelberg, Rüdiger Stephan	On cardinality constrained polymatroids.	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
24	András Frank, Tamás Király, Júlia Pap, David Pritchard	Characterizing and recognizing generalized polymatroids.	Math. Program.	2014	DBLP DOI BibTeX RDF
24	Vijayvaradharaj T. Muralidharan, B. Sundar Rajan	Linear index coding and representable discrete polymatroids.	ISIT	2014	DBLP DOI BibTeX RDF
24	Tobias Harks, Max Klimm, Britta Peis	Resource Competition on Integral Polymatroids.	WINE	2014	DBLP DOI BibTeX RDF
24	Dennis Hall	Essential elements in connected k-polymatroids.	Adv. Appl. Math.	2013	DBLP DOI BibTeX RDF
24	Vijayvaradharaj T. Muralidharan, B. Sundar Rajan	Linear Network Coding, Linear Index Coding and Representable Discrete Polymatroids.	CoRR	2013	DBLP BibTeX RDF
24	Vijayvaradharaj T. Muralidharan, B. Sundar Rajan	Linear Fractional Network Coding and Representable Discrete Polymatroids	CoRR	2013	DBLP BibTeX RDF
24	Vijayvaradharaj T. Muralidharan, B. Sundar Rajan	On the Vector Linear Solvability of Networks and Discrete Polymatroids	CoRR	2013	DBLP BibTeX RDF
24	Vijayvaradharaj T. Muralidharan, B. Sundar Rajan	Linear Fractional Network Coding and representable discrete polymatroids.	GLOBECOM	2013	DBLP DOI BibTeX RDF
24	Frantisek Matús	Polymatroids and polyquantoids	CoRR	2012	DBLP BibTeX RDF
24	Terence Chan, Alex J. Grant, Doris Pflüger	Truncation Technique for Characterizing Linear Polymatroids.	IEEE Trans. Inf. Theory	2011	DBLP DOI BibTeX RDF
24	Rüdiger Stephan, Ingo Spiegelberg	On cardinality constrained polymatroids.	Electron. Notes Discret. Math.	2010	DBLP DOI BibTeX RDF
24	Te Sun Han	Polymatroids with Network Coding	CoRR	2010	DBLP BibTeX RDF
24	Jaume Martí-Farré, Carles Padró	On secret sharing schemes, matroids and polymatroids.	J. Math. Cryptol.	2010	DBLP DOI BibTeX RDF
24	Terence Chan, Alex J. Grant, Doris Kern	Existence of new inequalities for representable polymatroids.	ISIT	2010	DBLP DOI BibTeX RDF
24	Te Sun Han	Polymatroids with network coding.	ITA	2010	DBLP DOI BibTeX RDF
24	Terence Chan, Alex J. Grant, Doris Kern	Existence of new inequalities for representable polymatroids	CoRR	2009	DBLP BibTeX RDF
24	Jesús A. De Loera, David C. Haws, Matthias Köppe	Ehrhart Polynomials of Matroid Polytopes and Polymatroids.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF
24	Jesús A. De Loera, David C. Haws, Matthias Köppe	Ehrhart Polynomials of Matroid Polytopes and Polymatroids.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF
24	Márton Makai, Jácint Szabó	The parity problem of polymatroids without double circuits.	Comb.	2008	DBLP DOI BibTeX RDF
24	Alper Atamtürk, Vishnu Narayanan	Polymatroids and mean-risk minimization in discrete optimization.	Oper. Res. Lett.	2008	DBLP DOI BibTeX RDF
24	Frantisek Matús	Adhesivity of polymatroids.	Discret. Math.	2007	DBLP DOI BibTeX RDF
24	Márton Makai, Gyula Pap, Jácint Szabó	Matching Problems in Polymatroids Without Double Circuits.	IPCO	2007	DBLP DOI BibTeX RDF	matroids and submodular functions
24	Jaume Martí-Farré, Carles Padró	On Secret Sharing Schemes, Matroids and Polymatroids.	IACR Cryptol. ePrint Arch.	2006	DBLP BibTeX RDF
24	Sachin B. Patkar, H. Narayanan	A note on optimal covering augmentation for graphic polymatroids.	Inf. Process. Lett.	2001	DBLP DOI BibTeX RDF
24	Frantisek Matús	Excluded minors for Boolean polymatroids.	Discret. Math.	2001	DBLP DOI BibTeX RDF
24	Ulrich Krüger	Structural Aspects of Ordered Polymatroids.	Discret. Appl. Math.	2000	DBLP DOI BibTeX RDF
24	Harold N. Gabow	Algorithms for Graphic Polymatroids and Parametris s-Sets.	J. Algorithms	1998	DBLP DOI BibTeX RDF
24	Dimitris Bertsimas, José Niño-Mora	Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems.	Math. Oper. Res.	1996	DBLP DOI BibTeX RDF
24	Arie Tamir	Least Majorized Elements and Generalized Polymatroids.	Math. Oper. Res.	1995	DBLP DOI BibTeX RDF
24	Harold N. Gabow	Algorithms for Graphic Polymatroids and Parametric s-Sets.	SODA	1995	DBLP DOI BibTeX RDF
24	Dirk Vertigan, Geoff Whittle	Recognizing Polymatroids Associated with Hypergraphs.	Comb. Probab. Comput.	1993	DBLP DOI BibTeX RDF
24	James G. Oxley, Geoff Whittle	Some exluded-minor theorems for a class of polymatroids.	Comb.	1993	DBLP DOI BibTeX RDF
24	James G. Oxley, Geoffrey P. Whittle	A Characterization of Tutte Invariants of 2-Polymatroids.	J. Comb. Theory, Ser. B	1993	DBLP DOI BibTeX RDF
24	Alexander Zelikovsky	An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs.	IPCO	1993	DBLP BibTeX RDF
24	Masataka Nakamura	Delta-polymatroids and an extension of Edmonds-Giles' TDI scheme.	IPCO	1993	DBLP BibTeX RDF
24	Dimitris Bertsimas, José Niño-Mora	Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems.	IPCO	1993	DBLP BibTeX RDF
24	Geoff Whittle	Duality in Polymatroids and Set Functions.	Comb. Probab. Comput.	1992	DBLP DOI BibTeX RDF
24	Donald M. Topkis	Paths on polymatroids.	Math. Program.	1992	DBLP DOI BibTeX RDF
24	Partha P. Bhattacharya, Leonidas Georgiadis, Pantelis Tsoucas	Extended Polymatroids: Properties and Optimization.	IPCO	1992	DBLP BibTeX RDF
24	Wolfgang W. Bein, Peter Brucker, Matthias F. M. Stallmann	A characterization of network representable polymatroids.	ZOR Methods Model. Oper. Res.	1991	DBLP DOI BibTeX RDF
24	James G. Oxley, Geoff Whittle	Tuttle invariants for 2-polymatroids.	Graph Structure Theory	1991	DBLP BibTeX RDF
24	Masataka Nakamura	Structural theorems for submodular functions, polymatroids and polymatroid intersections.	Graphs Comb.	1988	DBLP DOI BibTeX RDF
24	András Frank, Éva Tardos	Generalized polymatroids and submodular flows.	Math. Program.	1988	DBLP DOI BibTeX RDF
24	Wolfgang W. Bein	Netflows, polymatroids, and greedy structures.		1987	RDF
24	Richard G. Ogier	Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut)		1985	RDF
24	Satoru Fujishige	A note on Frank's generalized polymatroids.	Discret. Appl. Math.	1984	DBLP DOI BibTeX RDF
24	Donald M. Topkis	Adjacency on polymatroids.	Math. Program.	1984	DBLP DOI BibTeX RDF
24	Colin McDiarmid	Blocking, antiblocking, and pairs of matroids and polymatroids.	J. Comb. Theory, Ser. B	1978	DBLP DOI BibTeX RDF
23	Ulrich Faigle, Satoru Fujishige	A general model for matroids and the greedy algorithm.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C27, 68R99, 05B35
23	Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata 0001, Vahab S. Mirrokni	Approximating submodular functions everywhere.	SODA	2009	DBLP DOI BibTeX RDF
23	Terence Chan, Alex J. Grant	Dualities Between Entropy Functions and Network Codes.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
23	F. Mat	Two Constructions on Limits of Entropy Functions.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
23	Kiyohito Nagano	On Convex Minimization over Base Polytopes.	IPCO	2007	DBLP DOI BibTeX RDF	convex optimization, submodular functions
23	Frantisek Matús	Piecewise linear conditional information inequality.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
23	Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence A. Wolsey	On unions and dominants of polytopes.	Math. Program.	2004	DBLP DOI BibTeX RDF