Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Könemann, Jochen
Larson, Kate
and
Steiner, David
2012.
Algorithmic Game Theory.
Vol. 7615,
Issue. ,
p.
216.
Nutov, Zeev
2012.
LATIN 2012: Theoretical Informatics.
Vol. 7256,
Issue. ,
p.
582.
Fukunaga, Takuro
and
Ravi, R.
2012.
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design.
p.
263.
Mastrolilli, Monaldo
and
Stamoulis, Georgios
2012.
Combinatorial Optimization.
Vol. 7422,
Issue. ,
p.
344.
Cheriyan, Joseph
and
Vegh, Laszlo A.
2013.
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs.
p.
30.
Khuller, Samir
and
Raghavachari, Balaji
2013.
Handbook of Combinatorial Optimization.
p.
1989.
Nguyen, Thanh
and
Vohra, Rakesh
2014.
Near Feasible Stable Matchings with Complementarities.
SSRN Electronic Journal,
Bernáth, Attila
Ciebiera, Krzysztof
Godlewski, Piotr
and
Sankowski, Piotr
2014.
Experimental Algorithms.
Vol. 8504,
Issue. ,
p.
74.
Akbarpour, Mohammad
and
Nikzad, Afshin
2014.
Approximate Random Allocation Mechanisms.
SSRN Electronic Journal,
Nutov, Zeev
2014.
Degree Constrained Node-Connectivity Problems.
Algorithmica,
Vol. 70,
Issue. 2,
p.
340.
Lau, Lap Chi
and
Zhou, Hong
2014.
Integer Programming and Combinatorial Optimization.
Vol. 8494,
Issue. ,
p.
369.
Tu, Jian-hua
Du, Jun-feng
and
Yang, Feng-mei
2014.
An iterative rounding 2-approximation algorithm for the k-partial vertex cover problem.
Acta Mathematicae Applicatae Sinica, English Series,
Vol. 30,
Issue. 2,
p.
271.
Korupolu, Madhukar
Meyerson, Adam
Rajaraman, Rajmohan
and
Tagiku, Brian
2014.
Integer Programming and Combinatorial Optimization.
Vol. 8494,
Issue. ,
p.
357.
Korupolu, Madhukar
Meyerson, Adam
Rajaraman, Rajmohan
and
Tagiku, Brian
2015.
Coupled and k-sided placements: generalizing generalized assignment.
Mathematical Programming,
Vol. 154,
Issue. 1-2,
p.
493.
Cheriyan, Joseph
Friggstad, Zachary
and
Gao, Zhihan
2015.
Approximating Minimum-Cost Connected T-Joins.
Algorithmica,
Vol. 72,
Issue. 1,
p.
126.
Canzar, Stefan
Elbassioni, Khaled
Klau, Gunnar W.
and
Mestre, Julián
2015.
On Tree-Constrained Matchings and Generalizations.
Algorithmica,
Vol. 71,
Issue. 1,
p.
98.
Könemann, Jochen
Larson, Kate
and
Steiner, David
2015.
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances.
Theory of Computing Systems,
Vol. 57,
Issue. 3,
p.
655.
Braun, Gábor
Fiorini, Samuel
Pokutta, Sebastian
and
Steurer, David
2015.
Approximation Limits of Linear Programs (Beyond Hierarchies).
Mathematics of Operations Research,
Vol. 40,
Issue. 3,
p.
756.
Lau, Lap Chi
and
Zhou, Hong
2015.
A unified algorithm for degree bounded survivable network design.
Mathematical Programming,
Vol. 154,
Issue. 1-2,
p.
515.
Singh, Mohit
and
Lau, Lap Chi
2015.
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal.
Journal of the ACM,
Vol. 62,
Issue. 1,
p.
1.