Koster, Arie M. C. A.
Overview
Works:  87 works in 164 publications in 2 languages and 1,613 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Editor, Author, Contributor, Other, dgs, Opponent, htt 
Classifications:  TK5105.5, 004.6 
Publication Timeline
.
Most widely held works by
Arie M. C. A Koster
Graphs and algorithms in communication networks : studies in broadband, optical, wireless and ad hoc networks by
Arie M. C. A Koster(
)
24 editions published between 2009 and 2013 in English and held by 555 WorldCat member libraries worldwide
Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research  in particular in algorithms, computational complexity, distributed computing and optimization  are vital to modern services such as mobile telephony, online banking and VoIP. This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293  a fouryear program of multidisciplinary research on this subject. In this book they offer introductory overviews and stateoftheart assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption. The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics. Research Keywords: Ad hoc networks  Broadband networks  Communication networks  Discrete algorithms  Distributed algorithms  Distributed computing  Network design  Network energy consumption  Network optimization  Network robustness  Operations research  Optical networks  Sensor networks  Telecommunication networks  Wireless networks Related subjects: Applications  Communication Networks  Signals & Communication  Theoretical Computer Science
24 editions published between 2009 and 2013 in English and held by 555 WorldCat member libraries worldwide
Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research  in particular in algorithms, computational complexity, distributed computing and optimization  are vital to modern services such as mobile telephony, online banking and VoIP. This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293  a fouryear program of multidisciplinary research on this subject. In this book they offer introductory overviews and stateoftheart assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption. The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics. Research Keywords: Ad hoc networks  Broadband networks  Communication networks  Discrete algorithms  Distributed algorithms  Distributed computing  Network design  Network energy consumption  Network optimization  Network robustness  Operations research  Optical networks  Sensor networks  Telecommunication networks  Wireless networks Related subjects: Applications  Communication Networks  Signals & Communication  Theoretical Computer Science
Operations research proceedings 2014 selected papers of the Annual International Conference of the German Operations Research
Society (GOR), RWTH Aachen University, Germany, September 25, 2014 by International Annual Conference of the German Operations Research Society(
)
7 editions published in 2016 in English and German and held by 232 WorldCat member libraries worldwide
This book contains a selection of refereed papers presented at the "International Conference on Operations Research (OR 2014)", which took place at RWTH Aachen University, Germany, September 25, 2014. More than 800 scientists and students from 47 countries attended OR 2014 and presented more than 500 papers in parallel topical streams, as well as special award sessions. The theme of the conference and its proceedings is "Business Analytics and Optimization"
7 editions published in 2016 in English and German and held by 232 WorldCat member libraries worldwide
This book contains a selection of refereed papers presented at the "International Conference on Operations Research (OR 2014)", which took place at RWTH Aachen University, Germany, September 25, 2014. More than 800 scientists and students from 47 countries attended OR 2014 and presented more than 500 papers in parallel topical streams, as well as special award sessions. The theme of the conference and its proceedings is "Business Analytics and Optimization"
Provably good solutions for wavelength assignment in optical networks by
Arie M. C. A Koster(
)
4 editions published in 2004 in English and held by 30 WorldCat member libraries worldwide
Abstract: "In this paper, we study the minimum converter wavelength assignment problem in optical networks. To benchmark the quality of solutions obtained by heuristics, we derive an integer programming formulation by generalizing the formulation of Mehrotra and Trick [12] for the vertex coloring problem. To handle the exponential number of variables, we propose a column generation approach. Computational experiments show that the value of the linear relaxation states a good lower bound and can often prove optimality of the best solution generated heuristically."
4 editions published in 2004 in English and held by 30 WorldCat member libraries worldwide
Abstract: "In this paper, we study the minimum converter wavelength assignment problem in optical networks. To benchmark the quality of solutions obtained by heuristics, we derive an integer programming formulation by generalizing the formulation of Mehrotra and Trick [12] for the vertex coloring problem. To handle the exponential number of variables, we propose a column generation approach. Computational experiments show that the value of the linear relaxation states a good lower bound and can often prove optimality of the best solution generated heuristically."
Wavelength assignment in multifiber WDM networks by generalized edge coloring by
Arie M. C. A Koster(
)
4 editions published in 2005 in English and held by 30 WorldCat member libraries worldwide
Abstract: "In this paper, we study wavelength assignment problems in multifiber WDM networks. We focus on the special case that all lightpaths have at most two links. This in particular holds in case the network topology is a star. As the links incident to a specific node in a meshed topology form a star subnetwork, results for stars are also of interest for general meshed topologies. We show that wavelength assignment with at most two links per lightpath can be modeled as a generalized edge coloring problem. By this relation, we show that for a network with an even number of fibers at all links and at most two links per lightpath, all lightpaths can be assigned a wavelength without conversion. Moreover, we derive a lower bound on the number of lightpaths to be converted for networks with arbitrary numbers of fibers at the links. A comparison with linear progamming lower bounds reveals that the bounds coincide for problems with at most two links per lightpath. For meshed topologies, the cumulative lower bound over all star subnetworks equals the best known solution value for all realistic wavelength assignment instances available, by this proving optimality."
4 editions published in 2005 in English and held by 30 WorldCat member libraries worldwide
Abstract: "In this paper, we study wavelength assignment problems in multifiber WDM networks. We focus on the special case that all lightpaths have at most two links. This in particular holds in case the network topology is a star. As the links incident to a specific node in a meshed topology form a star subnetwork, results for stars are also of interest for general meshed topologies. We show that wavelength assignment with at most two links per lightpath can be modeled as a generalized edge coloring problem. By this relation, we show that for a network with an even number of fibers at all links and at most two links per lightpath, all lightpaths can be assigned a wavelength without conversion. Moreover, we derive a lower bound on the number of lightpaths to be converted for networks with arbitrary numbers of fibers at the links. A comparison with linear progamming lower bounds reveals that the bounds coincide for problems with at most two links per lightpath. For meshed topologies, the cumulative lower bound over all star subnetworks equals the best known solution value for all realistic wavelength assignment instances available, by this proving optimality."
Minimum converter wavelength assignment in all optical networks by
Arie M. C. A Koster(
)
4 editions published in 2003 in English and held by 29 WorldCat member libraries worldwide
Abstract: "Finding conflictfree wavelength assignments with a minimum number of required conversions for a routing of the lightpaths is one of the important tasks within the design of alloptical networks. We consider this problem in multifiber networks with different types of WDM systems. We give a detailed description of the problem and derive its theoretical complexity. For practical application, we propose several sequential algorithms to compute appropriate wavelength assignments. We also perform computational experiments to evaluate their performance. For the iterative algorithms, we identify characteristic patterns of progression. Two of these algorithms qualify for application in practice."
4 editions published in 2003 in English and held by 29 WorldCat member libraries worldwide
Abstract: "Finding conflictfree wavelength assignments with a minimum number of required conversions for a routing of the lightpaths is one of the important tasks within the design of alloptical networks. We consider this problem in multifiber networks with different types of WDM systems. We give a detailed description of the problem and derive its theoretical complexity. For practical application, we propose several sequential algorithms to compute appropriate wavelength assignments. We also perform computational experiments to evaluate their performance. For the iterative algorithms, we identify characteristic patterns of progression. Two of these algorithms qualify for application in practice."
Transparent optical network design with sparse wavelength conversion by
Adrian Zymolka(
)
3 editions published in 2002 in English and held by 27 WorldCat member libraries worldwide
Abstract: "We consider the design of transparent optical networks from a practical perspective. Network operators aim at satisfying the communication demands at minimum cost. Such an optimization involves three interdependent planning issues: the dimensioning of the physical topology, the routing of lightpaths, and the wavelength assignment. Further topics include the reliability of the configuration and sparse wavelength conversion for efficient use of the capacities. In this paper, we investigate this extensive optical network design task. Using a flexible devicebased model, we present an integer programming formulation that supports greenfield planning as well as expansion planning on top of an existing network. As solution method, we propose a suitable decomposition approach that separates the wavelength assignment from the dimensioning and routing. Our method in particular provides a lower bound on the total cost which allows to rate the solution quality. Computational experiments on realistic networks approve the solution approach to be appropriate."
3 editions published in 2002 in English and held by 27 WorldCat member libraries worldwide
Abstract: "We consider the design of transparent optical networks from a practical perspective. Network operators aim at satisfying the communication demands at minimum cost. Such an optimization involves three interdependent planning issues: the dimensioning of the physical topology, the routing of lightpaths, and the wavelength assignment. Further topics include the reliability of the configuration and sparse wavelength conversion for efficient use of the capacities. In this paper, we investigate this extensive optical network design task. Using a flexible devicebased model, we present an integer programming formulation that supports greenfield planning as well as expansion planning on top of an existing network. As solution method, we propose a suitable decomposition approach that separates the wavelength assignment from the dimensioning and routing. Our method in particular provides a lower bound on the total cost which allows to rate the solution quality. Computational experiments on realistic networks approve the solution approach to be appropriate."
Capacitated network design using general flowcutset inequalities(
)
2 editions published in 2007 in English and held by 26 WorldCat member libraries worldwide
This paper deals with directed, bidirected, and undirected capacitated network design problems. Using mixed integer rounding (MIR), we generalize flowcutset inequalities to these three link types and to an arbitrary modular link capacity structure, and propose a generic separation algorithm. In an extensive computational study on 54 instances from the Survivable Network Design Library (SNDlib), we show that the performance of cplex can significantly be enhanced by this class of cutting planes. The computations reveal the particular importance of the subclass of cutsetinequalities
2 editions published in 2007 in English and held by 26 WorldCat member libraries worldwide
This paper deals with directed, bidirected, and undirected capacitated network design problems. Using mixed integer rounding (MIR), we generalize flowcutset inequalities to these three link types and to an arbitrary modular link capacity structure, and propose a generic separation algorithm. In an extensive computational study on 54 instances from the Survivable Network Design Library (SNDlib), we show that the performance of cplex can significantly be enhanced by this class of cutting planes. The computations reveal the particular importance of the subclass of cutsetinequalities
Frequency planning and ramifications of coloring by
Andreas Eisenblätter(
)
4 editions published between 2000 and 2001 in English and held by 24 WorldCat member libraries worldwide
Abstract: "This paper surveys frequency assignment problems coming up in planning wireless communication services. It particularly focuses on cellular mobile phone systems such as GSM, a technology that revolutionizes communication. Traditional vertex coloring provides a conceptual framework for the mathematical modeling of many frequency planning problems. This basic form, however, needs various extensions to cover technical and organizational side constraints. Among these ramifications are Tcoloring and list coloring. To model all the subtleties, the techniques of integer programming have proven to be very useful. The ability to produce good frequency plans in practice is essential for the quality of mobile phone networks. The present algorithmic solution methods employ variants of some of the traditional coloring heuristics as well as more sophisticated machinery from mathematical programming. This paper will also address this issue. Finally, this paper discusses several practical frequency assignment problems in detail, states the associated mathematical models, and also points to public electronic libraries of frequency assignment problems from practice. The associated graphs have up to several thousand nodes and range form [sic] rather sparse to almost complete."
4 editions published between 2000 and 2001 in English and held by 24 WorldCat member libraries worldwide
Abstract: "This paper surveys frequency assignment problems coming up in planning wireless communication services. It particularly focuses on cellular mobile phone systems such as GSM, a technology that revolutionizes communication. Traditional vertex coloring provides a conceptual framework for the mathematical modeling of many frequency planning problems. This basic form, however, needs various extensions to cover technical and organizational side constraints. Among these ramifications are Tcoloring and list coloring. To model all the subtleties, the techniques of integer programming have proven to be very useful. The ability to produce good frequency plans in practice is essential for the quality of mobile phone networks. The present algorithmic solution methods employ variants of some of the traditional coloring heuristics as well as more sophisticated machinery from mathematical programming. This paper will also address this issue. Finally, this paper discusses several practical frequency assignment problems in detail, states the associated mathematical models, and also points to public electronic libraries of frequency assignment problems from practice. The associated graphs have up to several thousand nodes and range form [sic] rather sparse to almost complete."
Operations Research Proceedings 2014 : Selected Papers of the Annual International Conference of the German Operations Research
Society (GOR), RWTH Aachen University, Germany, September 25, 2014(
)
1 edition published in 2016 in English and held by 22 WorldCat member libraries worldwide
1 edition published in 2016 in English and held by 22 WorldCat member libraries worldwide
Structural Properties of Linearized Power Flows and Power Grid Design by
Stephan Lemkens(
)
1 edition published in 2015 in English and held by 21 WorldCat member libraries worldwide
1 edition published in 2015 in English and held by 21 WorldCat member libraries worldwide
The extreme points of QSTAB(G) and its implications by
Arie M. C. A Koster(
)
2 editions published in 2006 in English and held by 19 WorldCat member libraries worldwide
Perfect graphs constitute a wellstudied graph class with a rich structure, reflected by many characterizations w.r.t different concepts. Perfect graphs are, e.g., characterized as precisely those graphs where the stable set polytope STAB coincides with the clique constraint stable set polytope QSTAB. For all imperfect graphs STAB QSTAB holds and, therefore, it is natural to measure imperfection in terms of the difference between STAB and QSTAB. Several concepts have been developed in this direction, for instance the dilation ratio of STAB and QSTAB which is equivalent to the imperfection ratio imp of . To determine imp, both knowledge on the facets of STAB and the extreme points of QSTAB is required. The antiblocking theory of polyhedra yields all dominating extreme points of QSTAB, provided a complete description of the facets of STAB is known. As this is typically not the case, we extend the result on antiblocking polyhedra to a complete characterization of the extreme points of QSTAB by establishing a 11 correspondence to the facetdefining subgraphs of . We discuss several consequences, in particular, we give alternative proofs of several famous results
2 editions published in 2006 in English and held by 19 WorldCat member libraries worldwide
Perfect graphs constitute a wellstudied graph class with a rich structure, reflected by many characterizations w.r.t different concepts. Perfect graphs are, e.g., characterized as precisely those graphs where the stable set polytope STAB coincides with the clique constraint stable set polytope QSTAB. For all imperfect graphs STAB QSTAB holds and, therefore, it is natural to measure imperfection in terms of the difference between STAB and QSTAB. Several concepts have been developed in this direction, for instance the dilation ratio of STAB and QSTAB which is equivalent to the imperfection ratio imp of . To determine imp, both knowledge on the facets of STAB and the extreme points of QSTAB is required. The antiblocking theory of polyhedra yields all dominating extreme points of QSTAB, provided a complete description of the facets of STAB is known. As this is typically not the case, we extend the result on antiblocking polyhedra to a complete characterization of the extreme points of QSTAB by establishing a 11 correspondence to the facetdefining subgraphs of . We discuss several consequences, in particular, we give alternative proofs of several famous results
Treewidth: computational experiments(
)
1 edition published in 2001 in English and held by 18 WorldCat member libraries worldwide
1 edition published in 2001 in English and held by 18 WorldCat member libraries worldwide
Schlussbericht: Robust Optimierung der Stromversorgungssyteme Verbundbezeichnung: Robuste Optimierung der StromVersorgungsSysteme
(ROSVS) by
Arie M. C. A Koster(
)
1 edition published in 2017 in German and held by 18 WorldCat member libraries worldwide
1 edition published in 2017 in German and held by 18 WorldCat member libraries worldwide
Algorithms to separate {0,1/2}ChvatalGomotory cuts(
)
1 edition published in 2007 in English and held by 18 WorldCat member libraries worldwide
ChvatalGomory cuts are among the most wellknown classes of cutting planes for general integer linear programs (ILPs). In case the constraint multipliers are either 0 or , such cuts are known as cuts. It has been proven by Caprara and Fischetti (1996) that separation of cuts is NPhard. In this paper, we study ways to separate cuts effectively in practice. We propose a range of preprocessing rules to reduce the size of the separation problem. The core of the preprocessing builds a Gaussian eliminationlike procedure. To separate the most violated cut, we formulate the (reduced) problem as integer linear program. Some simple heuristic separation routines complete the algorithmic framework. Computational experiments on benchmark instances show that the combination of preprocessing with exact and/or heuristic separation is a very vital idea to generate strong generic cutting planes for integer linear programs and to reduce the overall computation times of stateoftheart ILPsolvers
1 edition published in 2007 in English and held by 18 WorldCat member libraries worldwide
ChvatalGomory cuts are among the most wellknown classes of cutting planes for general integer linear programs (ILPs). In case the constraint multipliers are either 0 or , such cuts are known as cuts. It has been proven by Caprara and Fischetti (1996) that separation of cuts is NPhard. In this paper, we study ways to separate cuts effectively in practice. We propose a range of preprocessing rules to reduce the size of the separation problem. The core of the preprocessing builds a Gaussian eliminationlike procedure. To separate the most violated cut, we formulate the (reduced) problem as integer linear program. Some simple heuristic separation routines complete the algorithmic framework. Computational experiments on benchmark instances show that the combination of preprocessing with exact and/or heuristic separation is a very vital idea to generate strong generic cutting planes for integer linear programs and to reduce the overall computation times of stateoftheart ILPsolvers
Robust network design formulations, valid inequalities, and computations(
)
1 edition published in 2011 in English and held by 18 WorldCat member libraries worldwide
1 edition published in 2011 in English and held by 18 WorldCat member libraries worldwide
Verbundprojekt 05M2013  VINO: Optimierung Virtueller Kommunikationsnetze, Teilprojekt 4  05M13PAA Schlussbericht(
)
1 edition published in 2017 in German and held by 18 WorldCat member libraries worldwide
1 edition published in 2017 in German and held by 18 WorldCat member libraries worldwide
Verbundprojekt ROBUKOM: Robuste Kommunikationsnetze; Teilprojekt: Robustes NetzwerkDesign unter Verkehrsunsicherheiten Schlussbericht(
)
2 editions published in 2014 in German and held by 18 WorldCat member libraries worldwide
2 editions published in 2014 in German and held by 18 WorldCat member libraries worldwide
On the strength of cutbased inequalities for capacitated network design polyhedra(
)
1 edition published in 2007 in English and held by 18 WorldCat member libraries worldwide
In this paper we study capacitated network design problems, differentiating directed, bidirected and undirected link capacity models. We complement existing polyhedral results for the three variants by new classes of facetdefining valid inequalities and unified lifting results. For this, we study the restriction of the problems to a cut of the network. First, we show that facets of the resulting cutset polyhedra translate into facets of the original network design polyhedra if the two subgraphs defined by the network cut are (strongly) connected. Second, we provide an analysis of the facial structure of cutset polyhedra, elaborating the differences caused by the three different types of capacity constraints. We present flowcutset inequalities for all three models and show under which conditions these are facetdefining. We also state a new class of facets for the bidirected and undirected case and it is shown how to handle multiple capacity modules by Mixed Integer Rounding (MIR)
1 edition published in 2007 in English and held by 18 WorldCat member libraries worldwide
In this paper we study capacitated network design problems, differentiating directed, bidirected and undirected link capacity models. We complement existing polyhedral results for the three variants by new classes of facetdefining valid inequalities and unified lifting results. For this, we study the restriction of the problems to a cut of the network. First, we show that facets of the resulting cutset polyhedra translate into facets of the original network design polyhedra if the two subgraphs defined by the network cut are (strongly) connected. Second, we provide an analysis of the facial structure of cutset polyhedra, elaborating the differences caused by the three different types of capacity constraints. We present flowcutset inequalities for all three models and show under which conditions these are facetdefining. We also state a new class of facets for the bidirected and undirected case and it is shown how to handle multiple capacity modules by Mixed Integer Rounding (MIR)
Singlelayer cuts for multilayer network design problems(
)
1 edition published in 2007 in English and held by 18 WorldCat member libraries worldwide
We study a planning problem arising in SDH/WDM multilayer telecommunication network design. The goal is to find a minimum cost installation of link and node hardware of both network layers such that traffic demands can be realized via grooming and a survivable routing. We present a mixedinteger programming formulation that takes many practical side constraints into account, including node hardware, several bitrates, and survivability against single physical node or link failures. This model is solved using a branchandcut approach with problemspecific preprocessing and cutting planes based on either of the two layers. On several realistic twolayer planning scenarios, we show that these cutting planes are still useful in the multilayer context, helping to increase the dual bound and to reduce the optimality gaps
1 edition published in 2007 in English and held by 18 WorldCat member libraries worldwide
We study a planning problem arising in SDH/WDM multilayer telecommunication network design. The goal is to find a minimum cost installation of link and node hardware of both network layers such that traffic demands can be realized via grooming and a survivable routing. We present a mixedinteger programming formulation that takes many practical side constraints into account, including node hardware, several bitrates, and survivability against single physical node or link failures. This model is solved using a branchandcut approach with problemspecific preprocessing and cutting planes based on either of the two layers. On several realistic twolayer planning scenarios, we show that these cutting planes are still useful in the multilayer context, helping to increase the dual bound and to reduce the optimality gaps
Comparing imperfection ratio and imperfection index for graph classes(
)
1 edition published in 2005 in English and held by 17 WorldCat member libraries worldwide
Perfect graphs constitute a wellstudied graph class with a rich structure, reflected by many characterizations with respect to different concepts. Perfect graphs are, for instance, precisely those graphs where the stable set polytope coincides with the fractional stable set polytope . For all imperfect graphs it holds that . It is, therefore, natural to use the difference between the two polytopes in order to decide how far an imperfect graph is away from being perfect; we discuss three different concepts, involving the facet set of , the disjunctive index of , and the dilation ratio of the two polytopes. Including only certain types of facets for , we obtain graphs that are in some sense close to perfect graphs, for example minimally imperfect graphs, and certain other classes of socalled rankperfect graphs. The imperfection ratio has been introduced by (Gerke and McDiarmid, 2001) as the dilation ratio of and , whereas (Aguilera et al., 2003) suggest to take the disjunctive index of as the imperfection index of
1 edition published in 2005 in English and held by 17 WorldCat member libraries worldwide
Perfect graphs constitute a wellstudied graph class with a rich structure, reflected by many characterizations with respect to different concepts. Perfect graphs are, for instance, precisely those graphs where the stable set polytope coincides with the fractional stable set polytope . For all imperfect graphs it holds that . It is, therefore, natural to use the difference between the two polytopes in order to decide how far an imperfect graph is away from being perfect; we discuss three different concepts, involving the facet set of , the disjunctive index of , and the dilation ratio of the two polytopes. Including only certain types of facets for , we obtain graphs that are in some sense close to perfect graphs, for example minimally imperfect graphs, and certain other classes of socalled rankperfect graphs. The imperfection ratio has been introduced by (Gerke and McDiarmid, 2001) as the dilation ratio of and , whereas (Aguilera et al., 2003) suggest to take the disjunctive index of as the imperfection index of
more
fewer
Audience Level
0 

1  
General  Special 
Related Identities
 Muñoz, Xavier Editor
 Peis, Britta Other Editor
 Letmathe, Peter Editor
 Walther, Grit Editor
 Madlener, Reinhard Editor
 Bodlaender, Hans L. Author
 Zymolka, Adrian Author Contributor
 L@221E@01A1bbecke, Marco Editor
 Wolle, Thomas Author
 Wessäly, Roland
Associated Subjects
Algorithms Business CommunicationNetwork analysis Computational complexity Computer algorithms Computer network architectures Computer networks Computer organization Computer science Computer simulation Computer software Data structures (Computer science) Decision making Electrical engineering Engineering economy Fiber optics Flowgraphs Frequency standards Game theory Graph algorithms Graph theory Integer programming Management science Operations research Optical data processing Production management Telecommunication TelecommunicationMathematics Telecommunication systems Wavelength division multiplexing Wavelengths Wireless communication systems