Result 1 to 20 of 29 total
Bisections above tight lower bounds. (English)
Golumbic, Martin Charles (ed.) et al., Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26‒28, 2012. Revised selcted papers. Berlin: Springer (ISBN 978-3-642-34610-1/pbk). Lecture Notes in Computer Science 7551, 184-193 (2012).
1
A flow model based on polylinking system. (English)
Math. Program. 135, No. 1-2 (A), 1-23 (2012).
2
A note on chromatic properties of threshold graphs. (English)
Discrete Math. 312, No. 10, 1838-1843 (2012).
3
Approximation algorithms for conflict-free vehicle routing. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 640-651 (2011).
4
High-confidence estimation of small $s-t$ reliabilities in directed acyclic networks. (English)
Networks 57, No. 4, 376-388 (2011).
5
Submodular function maximization via the multilinear relaxation and contention resolution schemes. (English)
Comput. Res. Repos. 2011, Article No. 1105.4593 (2011).
6
Stochastic convergence of random search methods to fixed size Pareto front approximations. (English)
Eur. J. Oper. Res. 213, No. 2, 414-421 (2011).
7
An $s$-$t$ connection problem with adaptability. (English)
Discrete Appl. Math. 159, No. 8, 695-705 (2011).
8
A 2-approximation for the maximum satisfying bisection problem. (English)
Eur. J. Oper. Res. 210, No. 2, 169-175 (2011).
9
A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling (English)
Transportation Science 45, No. 2, 212-227 (2011).
10
Approximation algorithms for conflict-free vehicle routing (English)
ESA, 640-651 (2011).
11
Multi-budgeted matchings and matroid intersection via dependent rounding (English)
SODA, 1080-1097 (2011).
12
Submodular function maximization via the multilinear relaxation and contention resolution schemes (English)
STOC, 783-792 (2011).
13
Matching interdiction. (English)
Discrete Appl. Math. 158, No. 15, 1676-1690 (2010).
14
Approximation schemes for multi-budgeted independence systems. (English)
de Berg, Mark (ed.) et al., Algorithms ‒ ESA 2010. 18th annual European symposium, Liverpool, UK, September 6‒8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 536-548 (2010).
15
Network flow interdiction on planar graphs. (English)
Discrete Appl. Math. 158, No. 13, 1441-1455 (2010).
16
Optimization with more than one budget. (English)
Comput. Res. Repos. 2010, Article No. 1002.2147 (2010).
17
Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid. (English)
Discrete Math. 310, No. 1, 132-146 (2010).
18
Approximation schemes for multi-budgeted independence systems (English)
ESA (1), 536-548 (2010).
19
Dependent randomized rounding via exchange properties of combinatorial structures (English)
FOCS, 575-584 (2010).
20
Result 1 to 20 of 29 total
Start
Contact
Print
General Help
