Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
145 | Gruia Calinescu, Alexander Zelikovsky |
The Polymatroid Steiner Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(3), pp. 281-294, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
wireless sensor networks, approximation algorithms, Steiner trees, polymatroid |
120 | Gruia Calinescu, Alexander Zelikovsky |
The Polymatroid Steiner Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 234-245, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
101 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
Matroid Intersections, Polymatroid Inequalities, and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 143-154, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 756-767, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
51 | Mao-cheng Cai, Xiaotie Deng, Lusheng Wang 0001 |
Minimum k Arborescences with Bandwidth Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(4), pp. 529-537, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 10(4), pp. 223-231, 1997. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 51(4), pp. 451-473, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(1), pp. 45-68, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '94, Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy, May 9-12, 1994, Proceedings, pp. 13-22, 1994, Springer, 3-540-60176-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 556-567, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | David D. Yao |
Dynamic Scheduling via Polymatroid Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Performance ![In: Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures, pp. 89-113, 2002, Springer, 3-540-44252-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 864-873, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
38 | Murali S. Kodialam |
The Throughput of Sequential Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 280-292, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
26 | Xin Zhang 0006, Stephen B. Wicker |
How to distribute sensors in a random field? ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPSN ![In: Proceedings of the Third International Symposium on Information Processing in Sensor Networks, IPSN 2004, Berkeley, California, USA, April 26-27, 2004, pp. 243-250, 2004, ACM, 1-58113-846-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 201, pp. 105798, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
25 | Joseph E. Bonin, Carolyn Chun, Tara Fife |
The Natural Matroid of an Integer Polymatroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 37(3), pp. 1751-1770, September 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.02987, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.08454, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Lisa Hellerstein, Thomas Lidbetter |
A game theoretic approach to a problem in polymatroid maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 305(2), pp. 979-988, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, pp. 56:1-56:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-295-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNCC ![In: International Symposium on Networks, Computers and Communications, ISNCC 2023, Doha, Qatar, October 23-26, 2023, pp. 1-4, 2023, IEEE, 979-8-3503-3559-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Sungjin Im, Benjamin Moseley, Hung Q. Ngo 0001, Kirk Pruhs, Alireza Samadian |
Optimizing Polymatroid Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.08381, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Sudhir R. Ghorpade, Trygve Johnsen |
A polymatroid approach to generalized weights of rank metric codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 88(12), pp. 2531-2546, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Satoru Iwata 0001, Yu Yokoi |
Finding a Stable Allocation in Polymatroid Intersection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 45(1), pp. 63-85, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Zachary Gershkoff, James G. Oxley |
A Note on the Connectivity of 2-Polymatroid Minors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 26(4), pp. 4, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Alper Atamtürk, Hyemin Jeon |
Lifted polymatroid inequalities for mean-risk optimization with indicator variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 73(4), pp. 677-699, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Sudhir R. Ghorpade, Trygve Johnsen |
A Polymatroid Approach to Generalized Weights of Rank Metric Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.01913, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Hao Ge, Randall Berry |
Quantized VCG Mechanisms for Polymatroid Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.11663, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Tatsuya Matsuoka, Zoltán Szigeti |
Polymatroid-based capacitated packing of branchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 270, pp. 190-203, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Kenjiro Takazawa, Yu Yokoi |
A generalized-polymatroid approach to disjoint common independent sets in two matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 342(7), pp. 2002-2011, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Hao Ge, Randall A. Berry |
Quantized VCG Mechanisms for Polymatroid Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing, Mobihoc 2019, Catania, Italy, July 2-5, 2019., pp. 261-270, 2019, ACM, 978-1-4503-6764-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: 2019 IEEE Conference on Computer Communications, INFOCOM 2019, Paris, France, April 29 - May 2, 2019, pp. 289-297, 2019, IEEE, 978-1-7281-0515-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Tarik Kaced |
Information Inequalities are Not Closed Under Polymatroid Duality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 64(6), pp. 4379-4381, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Tobias Harks, Veerle Timmermans |
Computing Equilibria in Atomic Splittable Polymatroid Congestion Games with Convex Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.04712, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
25 | Tobias Harks, Veerle Timmermans |
Uniqueness of equilibria in atomic splittable polymatroid congestion games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 36(3), pp. 812-830, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSP ![In: 2018 IEEE Statistical Signal Processing Workshop, SSP 2018, Freiburg im Breisgau, Germany, June 10-13, 2018, pp. 318-322, 2018, IEEE, 978-1-5386-1571-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Yu Yokoi |
A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 42(1), pp. 238-255, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
25 | Tobias Harks, Tim Oosterwijk, Tjark Vredeveld |
A logarithmic approximation for polymatroid congestion games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 44(6), pp. 712-717, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1608.03664, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
25 | Satoru Iwata 0001, Yu Yokoi |
Finding a Stable Allocation in Polymatroid Intersection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pp. 1034-1047, 2016, SIAM, 978-1-61197-433-1. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Tobias Harks, Veerle Timmermans |
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCO ![In: Combinatorial Optimization - 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers, pp. 98-109, 2016, Springer, 978-3-319-45586-0. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti |
Applications of Polymatroid Theory to Distributed Storage Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1510.02499, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
25 | Tobias Harks, Veerle Timmermans |
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1512.01375, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
25 | Paul Dütting, Robert Kleinberg |
Polymatroid Prophet Inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, pp. 437-449, 2015, Springer, 978-3-662-48349-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti |
Applications of polymatroid theory to distributed storage systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Allerton ![In: 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, Allerton Park & Retreat Center, Monticello, IL, USA, September 29 - October 2, 2015, pp. 231-237, 2015, IEEE, 978-1-5090-1824-6. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Maximilian Riemensberger, Wolfgang Utschick |
A Polymatroid Flow Model for Network Coded Multicast in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 60(1), pp. 443-460, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
25 | Branislav Kveton, Zheng Wen, Azin Ashkan, Michal Valko |
Learning to Act Greedily: Polymatroid Semi-Bandits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1405.7752, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
25 | P. T. Akhil, Rahul Singh 0001, Rajesh Sundaresan |
A polymatroid approach to separable convex optimization with linear ascending constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NCC ![In: Twentieth National Conference on Communications, NCC 2014, Kanpur, India, February 28 - March 2, 2014, pp. 1-5, 2014, IEEE, 978-1-4799-2361-8. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
25 | Paul Duetting, Robert Kleinberg |
Polymatroid Prophet Inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1307.5299, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
25 | Simai He, Jiawei Zhang 0006, Shuzhong Zhang |
Polymatroid Optimization, Submodularity, and Joint Replenishment Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 60(1), pp. 128-137, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Satyajit Thakor, Alex J. Grant, Terence Chan |
Compact representation of polymatroid axioms for random variables with conditional independencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITW ![In: 2012 IEEE Information Theory Workshop, Lausanne, Switzerland, September 3-7, 2012, pp. 267-271, 2012, IEEE, 978-1-4673-0224-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Mohammad Ali Maddah-Ali, Amin Mobasher, Amir K. Khandani |
Fairness in multiuser systems with polymatroid capacity region. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 55(5), pp. 2128-2138, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Deborah Chun |
Deletion-contraction to form a polymatroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(8), pp. 2592-2595, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Gruia Calinescu, Chandra Chekuri, Jan Vondrák |
Disjoint bases in a polymatroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 35(4), pp. 418-430, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Jean Fonlupt, Alexandre Skoda |
Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bonn Workshop of Combinatorial Optimization ![In: Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial Optimization, November 3-7, 2008, Bonn, Germany, pp. 69-85, 2008, Springer, 978-3-540-76795-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Steven D. Noble |
Evaluating the Rank Generating Function of a Graphic 2-Polymatroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 15(3), pp. 449-461, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Mohammad Ali Maddah-Ali, Amin Mobasher, Amir K. Khandani |
Fairness in Multiuser Systems with Polymatroid Capacity Region ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0606099, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
25 | Mohammad Ali Maddah-Ali, Amin Mobasher, Amir K. Khandani |
Using Polymatroid Structures to Provide Fairness in Multiuser Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006, pp. 158-162, 2006, IEEE, 1-4244-0504-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
An inequality for polymatroid functions and its applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 131(2), pp. 255-281, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Manoel Lemos |
Uniqueness of the decomposition of the rank function of a 2-polymatroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 269(1-3), pp. 161-179, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Toshihiro Fujito |
Approximating Polymatroid Packing and Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5), pp. 1066-1070, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
25 | Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
Parametric Polymatroid Optimization and Its Geometric Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Geom. Appl. ![In: Int. J. Comput. Geom. Appl. 12(5), pp. 429-444, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Kazuo Murota, Akiyoshi Shioura |
M-Convex Function on Generalized Polymatroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 24(1), pp. 95-105, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
25 | Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
Parametric Polymatroid Optimization and Its Geometric Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA., pp. 517-526, 1999, ACM/SIAM, 0-89871-434-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 44(7), pp. 2796-2815, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 19(1), pp. 112-120, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Masataka Nakamura |
Structural theorems for submodular functions, polymatroids and polymatroid intersections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 4(1), pp. 257-284, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
25 | Hiroshi Kaneko, Masanori Fushimi |
A polymatroid associated with convex games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 14(1), pp. 33-45, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
25 | Horst W. Hamacher |
Maximal dynamic polymatroid flows and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 15(1), pp. 41-54, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
25 | Robert E. Bixby, William H. Cunningham, Donald M. Topkis |
The Partial Order of a Polymatroid Extreme Point. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 10(3), pp. 367-378, 1985. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 32(2), pp. 238-241, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
25 | Bernhard Korte, László Lovász 0001 |
Polymatroid greedoids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 38(1), pp. 41-72, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
25 | Satoru Fujishige |
Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 5(2), pp. 186-196, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
19 | Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata 0001, Vahab S. Mirrokni |
Approximating submodular functions everywhere. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 535-544, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Navid Ehsan, Tara Javidi |
Delay Optimal Transmission Policy in a Wireless Multiaccess Channel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(8), pp. 3745-3751, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Ulrich Faigle, Britta Peis |
A Hierarchical Model for Cooperative Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings, pp. 230-241, 2008, Springer, 978-3-540-79308-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Ulrich Faigle, Britta Peis |
Two-phase greedy algorithms for some classes of combinatorial linear programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 161-166, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
19 | Gerald Lach, Marco E. Lübbecke |
Optimal University Course Timetables and the Partial Transversal Polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental Algorithms, 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30-June 1, 2008, Proceedings, pp. 235-248, 2008, Springer, 978-3-540-68548-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
partial transversal polytope, university course timetabling, integer programming |
19 | F. Mat |
Two Constructions on Limits of Entropy Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(1), pp. 320-330, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Márton Makai, Gyula Pap, Jácint Szabó |
Matching Problems in Polymatroids Without Double Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings, pp. 167-181, 2007, Springer, 978-3-540-72791-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
matroids and submodular functions |
19 | Natalia V. Shakhlevich, Vitaly A. Strusevich |
Pre-Emptive Scheduling Problems with Controllable Processing Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 8(3), pp. 233-253, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 22(6), pp. 977-987, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Kazuo Murota, Akihisa Tamura |
Proximity theorems of discrete convex functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 99(3), pp. 539-562, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
discrete convex analysis, proximity properties, optimality criteria |
19 | Gruia Calinescu |
Bounding the Payment of Approximate Truthful Mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 221-233, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Takeshi Tokuyama |
Minimax parametric optimization problems and multi-dimensional parametric searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 75-83, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Tibor Jordán |
Edge-Splitting Problems with Demands. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 273-288, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Ulrich Faigle |
On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 32(4), pp. 861-870, October 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|