Search results for "Polymatroid"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
145	Gruia Calinescu, Alexander Zelikovsky	The Polymatroid Steiner Problems.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	wireless sensor networks, approximation algorithms, Steiner trees, polymatroid
120	Gruia Calinescu, Alexander Zelikovsky	The Polymatroid Steiner Problems.	ISAAC	2004	DBLP DOI BibTeX RDF
101	Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan	Matroid Intersections, Polymatroid Inequalities, and Related Problems.	MFCS	2002	DBLP DOI BibTeX RDF
63	Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly A. Strusevich	Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach.	ESA	2008	DBLP DOI BibTeX RDF
51	Mao-cheng Cai, Xiaotie Deng, Lusheng Wang 0001	Minimum k Arborescences with Bandwidth Constraints.	Algorithmica	2004	DBLP DOI BibTeX RDF	Arborescence, Polymatroid intersection, Algorithm and complexity, Maximum flow, Matroid, Digraph, Polymatroid
51	László Csirmaz	The Size of a Share Must Be Large.	J. Cryptol.	1997	DBLP DOI BibTeX RDF	Polymatroid structures, Polymatroid structures, Secret sharing, Secret sharing, Key words, Ideal secret sharing schemes, Ideal secret sharing schemes, Perfect security, Perfect security
45	Natalia V. Shakhlevich, Vitaly A. Strusevich	Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times.	Algorithmica	2008	DBLP DOI BibTeX RDF	Uniform parallel machine scheduling, Generalized polymatroid, Maximum flow, Controllable processing times
45	Sachin B. Patkar, H. Narayanan	Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	Principal Partition, network, graph, on-line algorithm, reinforcement, polymatroid, strength
45	László Csirmaz	The Size of a Share Must Be Large.	EUROCRYPT	1994	DBLP DOI BibTeX RDF	polymatroid structures, Secret sharing, ideal secret sharing schemes, perfect security
44	Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich	Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities.	MFCS	2005	DBLP DOI BibTeX RDF
44	David D. Yao	Dynamic Scheduling via Polymatroid Optimization.	Performance	2002	DBLP DOI BibTeX RDF
38	Sushil Bikhchandani, Sven de Vries, James Schummer, Rakesh V. Vohra	Ascending auctions for integral (poly)matroids with concave nondecreasing separable values.	SODA	2008	DBLP BibTeX RDF
38	Murali S. Kodialam	The Throughput of Sequential Testing.	IPCO	2001	DBLP DOI BibTeX RDF
26	Xin Zhang 0006, Stephen B. Wicker	How to distribute sensors in a random field?	IPSN	2004	DBLP DOI BibTeX RDF	Gaussian source, contra-polymatroid, multiterminal source coding, rate allocation, water-filling
25	Xiaxia Guan, Weiling Yang, Xian'an Jin	On the polymatroid Tutte polynomial.	J. Comb. Theory, Ser. A	2024	DBLP DOI BibTeX RDF
25	Joseph E. Bonin, Carolyn Chun, Tara Fife	The Natural Matroid of an Integer Polymatroid.	SIAM J. Discret. Math.	2023	DBLP DOI BibTeX RDF
25	Elfarouk Harb, Kent Quanrud, Chandra Chekuri	Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing.	CoRR	2023	DBLP DOI BibTeX RDF
25	Katharina Eickhoff, Britta Peis, Niklas Rieken, Laura Vargas Koch, László A. Végh	Faster Ascending Auctions via Polymatroid Sum.	CoRR	2023	DBLP DOI BibTeX RDF
25	Lisa Hellerstein, Thomas Lidbetter	A game theoretic approach to a problem in polymatroid maximization.	Eur. J. Oper. Res.	2023	DBLP DOI BibTeX RDF
25	Elfarouk Harb, Kent Quanrud, Chandra Chekuri	Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing.	ESA	2023	DBLP DOI BibTeX RDF
25	Jiahong Wu, Nan Liu 0001, Wei Kang 0002	The Closure of the Entropy Region is Not Closed Under Polymatroid Duality for Four Discrete Random Variables.	ISNCC	2023	DBLP DOI BibTeX RDF
25	Sungjin Im, Benjamin Moseley, Hung Q. Ngo 0001, Kirk Pruhs, Alireza Samadian	Optimizing Polymatroid Functions.	CoRR	2022	DBLP DOI BibTeX RDF
25	Sudhir R. Ghorpade, Trygve Johnsen	A polymatroid approach to generalized weights of rank metric codes.	Des. Codes Cryptogr.	2020	DBLP DOI BibTeX RDF
25	Satoru Iwata 0001, Yu Yokoi	Finding a Stable Allocation in Polymatroid Intersection.	Math. Oper. Res.	2020	DBLP DOI BibTeX RDF
25	Zachary Gershkoff, James G. Oxley	A Note on the Connectivity of 2-Polymatroid Minors.	Electron. J. Comb.	2019	DBLP DOI BibTeX RDF
25	Alper Atamtürk, Hyemin Jeon	Lifted polymatroid inequalities for mean-risk optimization with indicator variables.	J. Glob. Optim.	2019	DBLP DOI BibTeX RDF
25	Sudhir R. Ghorpade, Trygve Johnsen	A Polymatroid Approach to Generalized Weights of Rank Metric Codes.	CoRR	2019	DBLP BibTeX RDF
25	Hao Ge, Randall Berry	Quantized VCG Mechanisms for Polymatroid Environments.	CoRR	2019	DBLP BibTeX RDF
25	Tatsuya Matsuoka, Zoltán Szigeti	Polymatroid-based capacitated packing of branchings.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
25	Kenjiro Takazawa, Yu Yokoi	A generalized-polymatroid approach to disjoint common independent sets in two matroids.	Discret. Math.	2019	DBLP DOI BibTeX RDF
25	Hao Ge, Randall A. Berry	Quantized VCG Mechanisms for Polymatroid Environments.	MobiHoc	2019	DBLP DOI BibTeX RDF
25	Peng-Jun Wan, Zhu Wang 0002, Huaqiang Yuan, Jinling Zhang, XuFei Mao	Fair Rate Allocation over A Generalized Symmetric Polymatroid with Box Constraints.	INFOCOM	2019	DBLP DOI BibTeX RDF
25	Tarik Kaced	Information Inequalities are Not Closed Under Polymatroid Duality.	IEEE Trans. Inf. Theory	2018	DBLP DOI BibTeX RDF
25	Tobias Harks, Veerle Timmermans	Computing Equilibria in Atomic Splittable Polymatroid Congestion Games with Convex Costs.	CoRR	2018	DBLP BibTeX RDF
25	Tobias Harks, Veerle Timmermans	Uniqueness of equilibria in atomic splittable polymatroid congestion games.	J. Comb. Optim.	2018	DBLP DOI BibTeX RDF
25	Yajing Liu, Edwin K. P. Chong, Ali Pezeshki	Extending Polymatroid Set Functions With Curvature and Bounding the Greedy Strategy.	SSP	2018	DBLP DOI BibTeX RDF
25	Yu Yokoi	A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas.	Math. Oper. Res.	2017	DBLP DOI BibTeX RDF
25	Tobias Harks, Tim Oosterwijk, Tjark Vredeveld	A logarithmic approximation for polymatroid congestion games.	Oper. Res. Lett.	2016	DBLP DOI BibTeX RDF
25	Xiaomao Mao, Huifang Chen, Peiliang Qiu	To Prolong the Lifetime of Wireless Sensor Networks: The Min-max Fair Scheduling in a Multi-access Contra-Polymatroid.	CoRR	2016	DBLP BibTeX RDF
25	Satoru Iwata 0001, Yu Yokoi	Finding a Stable Allocation in Polymatroid Intersection.	SODA	2016	DBLP DOI BibTeX RDF
25	Tobias Harks, Veerle Timmermans	Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games.	ISCO	2016	DBLP DOI BibTeX RDF
25	Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti	Applications of Polymatroid Theory to Distributed Storage Systems.	CoRR	2015	DBLP BibTeX RDF
25	Tobias Harks, Veerle Timmermans	Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games.	CoRR	2015	DBLP BibTeX RDF
25	Paul Dütting, Robert Kleinberg	Polymatroid Prophet Inequalities.	ESA	2015	DBLP DOI BibTeX RDF
25	Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti	Applications of polymatroid theory to distributed storage systems.	Allerton	2015	DBLP DOI BibTeX RDF
25	Maximilian Riemensberger, Wolfgang Utschick	A Polymatroid Flow Model for Network Coded Multicast in Wireless Networks.	IEEE Trans. Inf. Theory	2014	DBLP DOI BibTeX RDF
25	Branislav Kveton, Zheng Wen, Azin Ashkan, Michal Valko	Learning to Act Greedily: Polymatroid Semi-Bandits.	CoRR	2014	DBLP BibTeX RDF
25	P. T. Akhil, Rahul Singh 0001, Rajesh Sundaresan	A polymatroid approach to separable convex optimization with linear ascending constraints.	NCC	2014	DBLP DOI BibTeX RDF
25	Paul Duetting, Robert Kleinberg	Polymatroid Prophet Inequalities.	CoRR	2013	DBLP BibTeX RDF
25	Simai He, Jiawei Zhang 0006, Shuzhong Zhang	Polymatroid Optimization, Submodularity, and Joint Replenishment Games.	Oper. Res.	2012	DBLP DOI BibTeX RDF
25	Satyajit Thakor, Alex J. Grant, Terence Chan	Compact representation of polymatroid axioms for random variables with conditional independencies.	ITW	2012	DBLP DOI BibTeX RDF
25	Mohammad Ali Maddah-Ali, Amin Mobasher, Amir K. Khandani	Fairness in multiuser systems with polymatroid capacity region.	IEEE Trans. Inf. Theory	2009	DBLP DOI BibTeX RDF
25	Deborah Chun	Deletion-contraction to form a polymatroid.	Discret. Math.	2009	DBLP DOI BibTeX RDF
25	Gruia Calinescu, Chandra Chekuri, Jan Vondrák	Disjoint bases in a polymatroid.	Random Struct. Algorithms	2009	DBLP DOI BibTeX RDF
25	Jean Fonlupt, Alexandre Skoda	Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid.	Bonn Workshop of Combinatorial Optimization	2008	DBLP DOI BibTeX RDF
25	Steven D. Noble	Evaluating the Rank Generating Function of a Graphic 2-Polymatroid.	Comb. Probab. Comput.	2006	DBLP DOI BibTeX RDF
25	Mohammad Ali Maddah-Ali, Amin Mobasher, Amir K. Khandani	Fairness in Multiuser Systems with Polymatroid Capacity Region	CoRR	2006	DBLP BibTeX RDF
25	Mohammad Ali Maddah-Ali, Amin Mobasher, Amir K. Khandani	Using Polymatroid Structures to Provide Fairness in Multiuser Systems.	ISIT	2006	DBLP DOI BibTeX RDF
25	Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan	An inequality for polymatroid functions and its applications.	Discret. Appl. Math.	2003	DBLP DOI BibTeX RDF
25	Manoel Lemos	Uniqueness of the decomposition of the rank function of a 2-polymatroid.	Discret. Math.	2003	DBLP DOI BibTeX RDF
25	Toshihiro Fujito	Approximating Polymatroid Packing and Covering.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2002	DBLP BibTeX RDF
25	Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama	Parametric Polymatroid Optimization and Its Geometric Applications.	Int. J. Comput. Geom. Appl.	2002	DBLP DOI BibTeX RDF
25	Kazuo Murota, Akiyoshi Shioura	M-Convex Function on Generalized Polymatroid.	Math. Oper. Res.	1999	DBLP DOI BibTeX RDF
25	Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama	Parametric Polymatroid Optimization and Its Geometric Applications.	SODA	1999	DBLP BibTeX RDF
25	David N. C. Tse, Stephen V. Hanly	Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities.	IEEE Trans. Inf. Theory	1998	DBLP DOI BibTeX RDF
25	Michael O. Ball, J. George Shanthikumar	Bounding a Probability Measure Over a Polymatroid with an Application to Transportation Problems.	Math. Oper. Res.	1994	DBLP DOI BibTeX RDF
25	Masataka Nakamura	Structural theorems for submodular functions, polymatroids and polymatroid intersections.	Graphs Comb.	1988	DBLP DOI BibTeX RDF
25	Hiroshi Kaneko, Masanori Fushimi	A polymatroid associated with convex games.	Discret. Appl. Math.	1986	DBLP DOI BibTeX RDF
25	Horst W. Hamacher	Maximal dynamic polymatroid flows and applications.	Discret. Appl. Math.	1986	DBLP DOI BibTeX RDF
25	Robert E. Bixby, William H. Cunningham, Donald M. Topkis	The Partial Order of a Polymatroid Extreme Point.	Math. Oper. Res.	1985	DBLP DOI BibTeX RDF
25	George Morton, Rabe von Randow, Karl Ringwald	A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory.	Math. Program.	1985	DBLP DOI BibTeX RDF
25	Bernhard Korte, László Lovász 0001	Polymatroid greedoids.	J. Comb. Theory, Ser. B	1985	DBLP DOI BibTeX RDF
25	Satoru Fujishige	Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector.	Math. Oper. Res.	1980	DBLP DOI BibTeX RDF
19	Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata 0001, Vahab S. Mirrokni	Approximating submodular functions everywhere.	SODA	2009	DBLP DOI BibTeX RDF
19	Navid Ehsan, Tara Javidi	Delay Optimal Transmission Policy in a Wireless Multiaccess Channel.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
19	Ulrich Faigle, Britta Peis	A Hierarchical Model for Cooperative Games.	SAGT	2008	DBLP DOI BibTeX RDF
19	Ulrich Faigle, Britta Peis	Two-phase greedy algorithms for some classes of combinatorial linear programs.	SODA	2008	DBLP BibTeX RDF
19	Gerald Lach, Marco E. Lübbecke	Optimal University Course Timetables and the Partial Transversal Polytope.	WEA	2008	DBLP DOI BibTeX RDF	partial transversal polytope, university course timetabling, integer programming
19	F. Mat	Two Constructions on Limits of Entropy Functions.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
19	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
19	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
19	Jun Chen, Xin Zhang 0006, Toby Berger, Stephen B. Wicker	An upper bound on the sum-rate distortion function and its corresponding rate allocation schemes for the CEO problem.	IEEE J. Sel. Areas Commun.	2004	DBLP DOI BibTeX RDF
19	Kazuo Murota, Akihisa Tamura	Proximity theorems of discrete convex functions.	Math. Program.	2004	DBLP DOI BibTeX RDF	discrete convex analysis, proximity properties, optimality criteria
19	Gruia Calinescu	Bounding the Payment of Approximate Truthful Mechanisms.	ISAAC	2004	DBLP DOI BibTeX RDF
19	Takeshi Tokuyama	Minimax parametric optimization problems and multi-dimensional parametric searching.	STOC	2001	DBLP DOI BibTeX RDF
19	Tibor Jordán	Edge-Splitting Problems with Demands.	IPCO	1999	DBLP DOI BibTeX RDF
19	Ulrich Faigle	On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms	J. ACM	1985	DBLP DOI BibTeX RDF