Faster Algorithms for Stable Allocation Problems

ISSN： 0178-4617

Source： Algorithmica, Vol.58, Iss.1, 2010-09, pp. : 59-81

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

By Fellows M. Knauer C. Nishimura N. Ragde P. Rosamond F. Stege U. Thilikos D. Whitesides S.

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 167-176

Springer Publishing Company

Access to resources Recommend Favorite

Efficient algorithms for buffer space allocation

By Gershwin S.B.

Annals of Operations Research, Vol. 93, Iss. 1-4, 2000-01 ,pp. : 117-144

Springer Publishing Company

Access to resources Recommend Favorite

Server Allocation Algorithms for Tiered Systems

By Chaudhuri Kamalika Kothari Anshul Pendavingh Rudi Swaminathan Ram Tarjan Robert Zhou Yunhong

Algorithmica, Vol. 48, Iss. 2, 2007-06 ,pp. : 129-146

Springer Publishing Company

Access to resources Recommend Favorite

Grouping Techniques for Scheduling Problems: Simpler and Faster

By Fishkin Aleksei Jansen Klaus Mastrolilli Monaldo

Algorithmica, Vol. 51, Iss. 2, 2008-06 ,pp. : 183-199

Springer Publishing Company

Access to resources Recommend Favorite

Faster exact solutions for some NP-hard problems

By Drori L. Peleg D.

Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. : 473-499

Elsevier

Access to resources Recommend Favorite