×

zbMATH — the first resource for mathematics

Workshop on graphs and combinatorial optimization. Papers from the workshop, Como, Italy, May 31, 2004. (English) Zbl 1109.05009
Electronic Notes in Discrete Mathematics 17. Amsterdam: Elsevier. 300 p., electronic only (2004).

Show indexed articles as search result.

The articles of this volume will be announced individually.
Indexed articles:
Ahuja, Nitin; Baltz, Andreas; Doerr, Benjamin; Srivastav, Anand, Coloring graphs with minimal edge load, 9-13 [Zbl 1125.05306]
Aïder, Méziane, Extended distance-hereditary graphs, 15-17 [Zbl 1152.05321]
Altın, A.; Amaldi, E.; Belotti, P.; Pınar, M. Ç., Virtual private network design under traffic uncertainty, 19-22 [Zbl 1152.68320]
Àlvarez, C.; Serna, M., The proper interval colored graph problem for caterpillar trees (extended abstract), 23-28 [Zbl 1152.05325]
Amaldi, Edoardo; Liberti, Leo; Maffioli, Francesco; Maculan, Nelson, Algorithms for finding minimum fundamental cycle bases in graphs, 29-33 [Zbl 1152.05370]
Aringhieri, Roberto; Cordone, Roberto, The multicommodity multilevel bottleneck assignment problem, 35-40 [Zbl 1152.05354]
Aringhieri, Roberto; Bruglieri, Maurizio; Malucelli, Federico; Nonato, Maddalena, An asymmetric vehicle routing problem arising in the collection and disposal of special waste, 41-47 [Zbl 1152.90573]
Bein, Wolfgang W., Knowledge state algorithms and the 2-server problem, 49 [Zbl 1152.68699]
Belotti, Pietro; Malucelli, Federico, Network design with grooming constraints, 51-56 [Zbl 1152.68323]
Betzler, Nadja; Niedermeier, Rolf; Uhlmann, Johannes, Tree decompositions of graphs: saving memory in dynamic programming, 57-62 [Zbl 1152.05355]
Brimkov, Valentin E., Clique, chromatic, and Lovász numbers of certain circulant graphs, 63-67 [Zbl 1152.05352]
Brueggemann, Tobias; Kern, Walter, An improved local search algorithm for 3-SAT, 69-73 [Zbl 1152.68544]
Cajkova, Miroslava; Fack, Veerle, Clique algorithms for classifying substructures in generalized quadrangles, 75-79 [Zbl 1152.51301]
Cantone, Domenico; Faro, Simone, Two-levels-greedy: a generalization of Dijkstra’s shortest path algorithm, 81-86 [Zbl 1152.90631]
Carrabs, F.; Cerulli, R.; Gentili, M.; Parlato, G., Minimum weighted feedback vertex set on diamonds, 87-91 [Zbl 1152.05371]
Chen, William Y. C.; Li, Xueliang; Wang, Chao; Zhang, Xiaoyan, Linear time algorithms to the minimum all-ones problem for unicyclic and bicyclic graphs, 93-98 [Zbl 1152.05373]
Chierici, Alessandro; Cordone, Roberto; Maja, Roberto, The demand-dependent optimization of regular train timetables, 99-104 [Zbl 1152.90435]
Costa, Marie-Christine; Billionnet, Alain, Multiway cut and integer flow problems in trees, 105-109 [Zbl 1152.90353]
Deineko, V., New exponential neighbourhood for polynomially solvable TSPs, 111-115 [Zbl 1152.90577]
Detti, Paolo; Meloni, Carlo; Pranzo, Marco, Minimum dominating trail set for two-terminal series parallel graphs, 117-122 [Zbl 1152.05374]
Dias, Vânia M. F.; de Figueiredo, Celina M. H.; Szwarcfiter, Jayme L., On the generation of bicliques of a graph, 123-127 [Zbl 1152.05353]
Doerr, Benjamin; Hebbinghaus, Nils; Werth, Sören, An improved discrepancy approach to declustering, 129-133 [Zbl 1152.68318]
Doi, Takashi; Fujito, Toshihiro, A primal-dual method for approximating tree cover with two weights, 135-140 [Zbl 1152.90632]
Emamy-K., M. R., The cut number of the \(n\)-cube, Boolean methods and a geometric connection to threshold logic, 141-143 [Zbl 1152.94460]
Faigle, Ulrich; Fuchs, Bernhard; Wienand, Britta, Covering graphs by colored stable sets, 145-149 [Zbl 1152.05357]
Faik, Taoufik, About the \(b\)-continuity of graphs: (extended abstract), 151-156 [Zbl 1152.05384]
Fomin, Fedor V.; Thilikos, Dimitrios M., A 3-approximation for the pathwidth of Halin graphs, 157-162 [Zbl 1152.05375]
Fouquet, Jean-Luc; Vanherpe, Jean-Marie, On \((P_{5})(\bar P_{5})\)-sparse graphs and other families: extended abstract, 163-167 [Zbl 1152.05362]
Giakoumakis, Vassilis; Olariu, Stephan, The set of prime extensions of a graph: the finite and the infinite case, 169-174 [Zbl 1152.05363]
Gijswijt, Dion, On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices, 175-178 [Zbl 1152.90443]
Gropp, Harald, More on orbital matrices, 179-183 [Zbl 1152.05311]
Hebbinghaus, Nils, Discrepancy of sums of arithmetic progressions, 185-189 [Zbl 1179.11021]
Joswig, Michael; Pfetsch, Marc E., Computing optimal discrete Morse functions, 191-195 [Zbl 1121.90423]
Kolliopoulos, Stavros G., Minimum-cost single-source 2-splittable flow, 197-201 [Zbl 1152.90634]
Liberti, Leo; Maculan, Nelson; Kucherenko, Sergei, The kissing number problem: a new result from global optimization, 203-207 [Zbl 1152.52304]
Lozovanu, D.; Pickl, S. W., A special dynamic programming technique for multiobjective discrete control and for dynamic games on graph-based networks, 209-214 [Zbl 1152.90642]
Märkert, Andreas; Schultz, Rüdiger, On deviation measures in stochastic integer programming, 215-218 [Zbl 1152.90540]
Maffioli, Francesco; Salvi, Norma Zagaglia, A particular class of graphic matroids, 219-222 [Zbl 1152.05315]
Nicosia, Gaia; Pacifici, Andrea, Exact algorithms for a discrete metric labeling problem, 223-227 [Zbl 1152.05368]
Nikolopoulos, Stavros D.; Palios, Leonidas, On the strongly connected and biconnected components of the complement of graphs, 229-235 [Zbl 1125.05320]
Prisner, Erich, \(k\)-pseudosnakes in \(n\)-dimensional hypercubes, 237-240 [Zbl 1125.05321]
Räbiger, Dirk, Semi-preemptive routing on a line, 241-246 [Zbl 1125.90317]
Righini, Giovanni; Salani, Matteo, Dynamic programming algorithms for the elementary shortest path problem with resource constraints, 247-249 [Zbl 1125.90420]
Salman, A. N. M.; Broersma, H. J., The Ramsey numbers of paths versus kipases, 251-255 [Zbl 1125.05314]
Tardella, Fabio, Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of linear programming, 257-262 [Zbl 1125.90403]
Torres, Luis M., On cliques associated to 3-set packing problems, 263-267 [Zbl 1125.05315]
Uejima, Akihiro; Ito, Hiro, Subdivision of the hierarchy of \(H\)-colorable graph classes by circulant graphs, 269-274 [Zbl 1125.05307]
Van Dyck, D.; Fack, V., To be or not to be Yutsis, 275-279 [Zbl 1125.68395]
Vietri, Andrea, The complexity of arc-colorings for directed hypergraphs, 281-284 [Zbl 1125.05308]
Wattenhofer, Mirjam; Wattenhofer, Roger, Fast and simple algorithms for weighted perfect matching, 285-291 [Zbl 1125.05318]
Zhang, Shenggui; Chen, Bing; Yu, Rongzu, Heavy cycles in \(k\)-connected weighted graphs, 293-296 [Zbl 1125.05311]
Zmazek, Blaž; Žerovnik, Janez, Behzad-Vizing conjecture and Cartesian product graphs, 297-300 [Zbl 1125.05309]
MSC:
05-06 Proceedings, conferences, collections, etc. pertaining to combinatorics
90-06 Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX XML Cite
Full Text: Link