Durán, Guillermo

Liebling, Thomas M.

Matamala, Martin

Infoscience - École polytechnique fédérale de Lausanne

Traces of the Latin American Conference on Combina-torics, Graphs and ApplicationsA selection of papers from LACGA 2004, Santiago, ChileIntroductionGuillermo Dura´n a, Thomas M. Liebling b and Mart´ın Matamala aaUniversidad de Chile, Santiago, ChilebEPFL, Lausanne, SwitzerlandThe present issue comprises papers presented at the Latin American Confer-ence on Combinatorics, Graphs and Applications LACGA, held August 2004in Santiago, Chile. That conference gathered scientists from Latin America,Europe and the US sharing their interest in modern aspects of discrete appliedmathematics, its ramifications and applications. Its venue and size, its subjectdiversity, and last not least, the particularly pleasant working environmentmade the meeting into an extremely fertile interaction forum between par-ticipants, be they well established researchers or young students. In betweenstimulating presentations, many informal exchanges took place, novel ideastook shape and new projects and partnerships were started. Many excitingnew results e.g. in extremal and polyhedral combinatorics, optimization overgraphs and applications were presented. This is well documented by the col-lection of papers presented in rhis issue and we are grateful to the Editor inChief of DAM for having agreed to host it in this Journal. We thank all theanonymous referees for their careful, competent and diligent reviewing of thesubmitted papers. We gratefully acknowledge the support from the MillenniumScience Nuclei “Complex Engineering Systems” and “Information and Ran-domness” in Chile as well as the Departments of Industrial Engineering andMathematical Engineering, and the Center of Mathematical Modeling of theUniversidad de Chile, that also hosted the meeting. Here is a quick overviewof the papers, classified into the categories: Graph Theory and Combinatorics,Combinatorial Optimization and Polyhedral Combinatorics, and Applications.Finally we would like to thank Marianne Ruegg for her competent support inpreparing this issue.Graph Theory and CombinatoricsOn maximum planar induced subgraphs, by Luerbio Faria, Celina M. Herrerade Figueiredo, Sylvain Gravier, Candido F. X. de Mendonc¸a, and Jorge Stolfi,resolves complexity issues about the problem of finding, for a given graph, thesmallest number of vertices whose deletion will result in a planar graph. The1problem itself and the associated approximation problems are NP-hard.Algorithms for clique-independent sets on subclasses of circular-arc graphs, byGuillermo Dura´n, Min Chih Lin, Sergio Mera, and Jayme Luiz Szwarcfiter,gives a linear time algorithm to solve the maximum cardinality of a clique-independent set in the special case where the graph is a Helly circular-arcgraph. Previous algorithms were in O(n3).The sandwich problem for cutsets: clique cutset, k-star cutset, by Rafael B.Texeira, and Celina M. Herrera de Figueiredo, proposes polynomial algorithmsfor several particular sandwich problems. In such problems two graphs aregiven and a third, with some particular property and whose edge set lies in-between, is found.Clique-Critical Graphs: bound on the number of vertices and recognition, byLiliana Alco´n, establishes that if graph G has m edges, then any clique-criticalgraph in the class of graphs whose clique-graph is G has at most 2m vertices.She also shows in this paper that recognizing a clique-critical graph is NP-complete.Some basic properties of multiple Hamiltonian covers, by Hans L. Fetter, in-troduces the concept of multiple Hamiltonian cover and studies it on cubic3-connected planar graphs. It also relates this notion to problems in geome-try.A Concentration Bound for the Longest Increasing Subsequence of a Ran-domly Chosen Involution, by Marcos Kiwi, provides a concentration result forthe length of the longest increasing sub-sequence of a randomly and uniformlychosen involution of the integers {1, . . . , s}.NP-completeness results for edge modification problems, by Pablo Burzyn,Flavia Bonomo, and Guillermo Dura´n, addresses the problem of endowinga graph with some given property by edge modifications. They present NP-completeness results for several classes of graphs such as interval, circular-arc,permutation and circle graphs.Combinatorial Optimization and Polyhedral CombinatoricsOn the Commutativity of antiblocker diagrams under lift-and-project operators,by Mariana Escalante, Graciela L. Nasini, and M.C. Varaldo, provides explicitproofs from the non-commutativity of various antiblocker duality diagramsassociated with the stable set polytope of a graph. To do so, they look at aparticular case of complements of line graphs of complete graphs.On a certain class of non-ideal clutters, by Gabriela R. Argiroffo, Silvia M.Bianchi, and Graciela L. Nasini, introduces the class of near-ideal clutterswhich is analogous to those introduced by Shepherd for near-perfect graphs.They give a similar polyhedral characterization for the former as Shepherddid for the latter. They show in particular that near-ideal blockers of graphsare blockers of near-bipartite graphs.On the Combinatorial Structure of Chromatic Scheduling Polytopes, by JavierMarenco, and Annegret Wagler, studies the structure of this polytope whicharises as solution set of the bandwidth allocation problem in radio access2networks and the like. In particular they study what happens to the polytopefor increasing frequency bands.Some Formulations for the Group Steiner Tree Problem, by Carlos E. Ferreira,and Fernando M. de Oliveira Filho. They are interested in a problem whichis a slide generalization of the original Steiner problem in graphs. New facetsdefining in equalities are presented in this problem.ApplicationsOn the Characterization of the Domination of a Diameter Constrained Net-work Reliability Model, by He´ctor Cancela, and Louis Petingi, deals with aproblem which is important in the context of reliable network design. Theproblem is that of designing a network whose arcs are subject to failure, suchthat the probability that the surviving arcs span a graph of given (s,K)-diameter exceeds some value. The (s,K)-diameter is the length of the longestsimple path from a node s to any node in the set K.Reoptimization Gaps versus Model Errors in Online-Dispatching of ServiceUnits for ADAC, by Benjamin Hiller, Sven O. Krumke, and Jo¨rg Rambau,considers the difficult online optimization problem of continuously assigningrescue vehicles to new emergency sites. The algorithms must be particularlyfast. They compare the methods implemented for the German AutomobileAssociation with “optimal solutions” found using an oracle.Online-Optimization of Multi-Elevator Transport Systems with Reoptimiza-tion Algorithms based on Set-Partitioning Models, by Philipp Friese, and Jo¨rgRambau. The authors develop, experiment and compare a control policies fora set of K elevators with unit capacity. This is a idealist version of a situationencountered in a large German inventory system.Maximizing breaks and bounding solutions to the mirrored traveling tourna-ment problem, by Sebastia´n Urrutia, and Celso Ribeiro, investigates the re-lation between two aspects of round robin tournament scheduling problems:breaks and distances and they present new heuristics for approximate solutionsof this problem.Santiago, LausanneOctober 20053

Latin-American Conference on Combinatorics, Graphs and Applications

http://infoscience.epfl.ch/record/99529/files/Final00_LAC20%20intro.pdf

Latin-American Conference on Combinatorics, Graphs and Applications

Abstract

Similar works

Full text

Available Versions

Infoscience - École polytechnique fédérale de Lausanne