Chien-Chung Huang

Visar 16 publikationer

2017

New algorithms for maximum weight matching and a decomposition theorem

Chien-Chung Huang, T. Kavitha
Mathematics of Operations Research. Vol. 42 (2), p. 411-426
Artikel i vetenskaplig tidskrift
2016

A combinatorial approximation algorithm for graph balancing with light hyper edges

Chien-Chung Huang, S. Ott
24th Annual European Symposium on Algorithms, ESA 2016, Aarhus, Denmark, 22-24 August 2016. Vol. 57
Paper i proceeding
2016

Exact and approximation algorithms for weighted matroid intersection

Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama
27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016; Arlington; United States; 10 January 2016 through 12 January 2016. Vol. 1, p. 430-444
Paper i proceeding
2016

Priority mutual exclusion: Specification and algorithm

Chien-Chung Huang, P. Jayanti
Lecture Notes in Computer Science. Vol. 9888, p. 385-398
Paper i proceeding
2016

Fair Matchings and Related Problems

Chien-Chung Huang, T. Kavitha, K. Mehlhorn et al
Algorithmica. Vol. 74 (3), p. 1184-1203
Artikel i vetenskaplig tidskrift
2015

A tight approximation bound for the stable marriage problem with restricted ties

Chien-Chung Huang, K. Iwama, S. Miyazaki et al
Leibniz International Proceedings in Informatics, LIPIcs. Vol. 40, p. 361-380
Paper i proceeding
2015

A fully polynomial-time approximation scheme for speed scaling with sleep state

A. Antoniadis, Chien-Chung Huang, S. Ott
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 2015-January (January), p. 1102-
Paper i proceeding
2015

Improved approximation algorithms for two variants of the stable marriage problem with ties

Chien-Chung Huang, T. Kavitha
Mathematical Programming, Series B. Vol. 154 (1-2), p. 353-380
Artikel i vetenskaplig tidskrift
2015

Maintaining Near-Popular Matchings

S. Bhattacharya, M. Hoefer, Chien-Chung Huang et al
Lecture Notes in Computer Science. Vol. 9135, p. 504-515
Paper i proceeding
2015

Popular matchings with two-sided preferences and one-sided ties

Á. Cseh, Chien-Chung Huang, T. Kavitha
Lecture Notes in Computer Science. Vol. 9134, p. 367-379
Paper i proceeding
2015

On the uniqueness of equilibrium in atomic splittable routing games

U. Bhaskar, L. Fleischer, D. Hoy et al
Mathematics of Operations Research. Vol. 40 (3), p. 634-654
Artikel i vetenskaplig tidskrift
2014

Optimal coordination mechanisms for multi-job scheduling games

F. Abed, J.R. Correa, Chien-Chung Huang
Lecture Notes in Computer Science. Vol. 8737, p. 13-24
Paper i proceeding
2014

New results for non-preemptive speed scaling

Chien-Chung Huang, S. Ott
Lecture Notes in Computer Science. Vol. 8635 (2), p. 360-371
Paper i proceeding
2014

An improved approximation algorithm for the stable marriage problem with one-sided ties

Chien-Chung Huang, T. Kavitha
Lecture Notes in Computer Science. Vol. 8494, p. 297-308
Paper i proceeding
2013

How to pack your items when you have to buy your knapsack

A. Antoniadis, Chien-Chung Huang, S. Ott et al
Lecture Notes in Computer Science. Vol. 8087, p. 62-73
Paper i proceeding
2013

Fair matchings and related problems

Chien-Chung Huang, T. Kavitha, K. Mehlhorn et al
Leibniz International Proceedings in Informatics, LIPIcs: 33rd International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013; Guwahati; India; 12 December 2013 through 14 December 2013. Vol. 24, p. 339-350
Paper i proceeding

Spara referenser

Om du har installerat Zotero eller Mendeley på din dator kan du direkt ta ut referenser från de publikationer du ser i listan.

Du laddar ner dessa pluginer här:
Zotero
Mendeley

Det finns inga projekt att visa.
Det kan finnas fler projekt där Chien-Chung Huang medverkar, men du måste vara inloggad som anställd på Chalmers för att kunna se dem.