Skip to main content
SpringerLink
Log in

A lagrangean decomposition for the maximum independent set problem applied to map labeling

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

The Maximum Independent Set (MIS) problem is a well-known problem where the aim is to find the maximum cardinality independent set in an associated graph. Map labeling problems can often be modeled as a MIS problem in a conflict graph, where labels are selected to be placed near graphical features not allowing overlaps (conflicts) between labels or between labels and features. However, the MIS problem is NP-hard and exact techniques present difficulties for solving some instances. Thus, this paper presents a Lagrangean decomposition to solve a map labeling problem, the Point-Feature Label Placement problem. We treated the problem by a conflict graph that is partitioned into small sub-problems and copies of some decision variables are done. These copies are used in the sub-problems constraints and in some constraints to ensure the equality between the original variables and their copies. After these steps, we relax these copy constraints in a Lagrangean way. Using instances proposed in the literature, our approach was able to prove the optimality for all of them, except one, and the results were better than the ones provided by a commercial solver.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Agarwal PK, van Kreveld MJ, Suri S (1998) Label placement by maximum independent set in rectangles. Comput Geom 11(3–4):209–218

    Article  Google Scholar 

  • Alvim ACF, Taillard ED (2009) Popmusic for the point feature label placement. Eur J Oper Res 192(2):396–413

    Article  Google Scholar 

  • Atamtürk A, Nemhauser GL, Savelsbergh MWP (2000) Conflict graphs in solving integer programming problems. Eur J Oper Res 121(1):40–55

    Article  Google Scholar 

  • Chalermsook P, Chushoy J (2009) Maximum independent set of rectangles. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, New York, pp 892–901

  • Chardaire P, Sutter A (1995) A decomposition method for quadratic zero-one programming. Manag Sci 41(4):704–712

    Article  Google Scholar 

  • Christensen J, Marks J, Shieber S (1994). Placing text labels on maps and diagrams. In: Heckbert P (ed) Graphics gems IV. Academic Press, Cambridge, pp 497–504

    Google Scholar 

  • Christensen J, Marks J, Shieber S (1995) An empirical study of algorithms for point-feature label placement. ACM Trans Graph 14(3):203–232

    Article  Google Scholar 

  • Cravo GL, Ribeiro GM, Lorena LAN (2008) A greedy randomized adaptive search procedure for the point-feature cartographic label placement. Comput Geosci 34(4):373–386

    Article  Google Scholar 

  • Formann M, Wagner F (1991) A packing problem with applications to lettering of maps. In: Proceedings of the Seventh Annual ACM Symposium on Computational Geometry, New Hampshire, pp 281–288

  • Fulkerson DR (1971) Blocking and anti-blocking pairs of polyhedra. Math Program 1:168–194

    Article  Google Scholar 

  • Gerrard RA, Church RL (1996) Closest assignment constraints and location models: properties and structure. Location Sci 4(4):251–270

    Article  Google Scholar 

  • Goycoolea M, Murray AT, Barahona F, Epstein R, Weintraub A (2005) Harvest scheduling subject to maximum area restrictions: exploring exact approaches. Oper Res 53(3):490–500

    Article  Google Scholar 

  • Guignard M (2003) Lagrangean relaxation. TOP 11(2):151–200

    Article  Google Scholar 

  • Held M, Karp RM (1970) The traveling salesman problem and minimum spanning trees. Oper Res 18(6):1138–1162

    Article  Google Scholar 

  • Ilog (2006) CPLEX user’s manual. Version 10.0, France, 478 p

  • Karp RM, Wigderson A (1985) A fast parallel algorithm for the maximal independent set problem. J ACM 32(4):762–773

    Article  Google Scholar 

  • Karypis G, Kumar V (1998) Multilevel k-way partitioning scheme for irregular graphs. J Parallel Distrib Comput 48(1):96–129

    Article  Google Scholar 

  • Klau GW (2001) A combinatorial approach to orthogonal placement problems. PhD Thesis, Saarlandes University, Saarbrücken, Germany

  • Klau GW, Mutzel P (2003) Optimal labeling of point features in rectangular labeling models. Math Program 94(2–3):435–458

    Article  Google Scholar 

  • Marks J, Shieber S (1991) The computational complexity of cartographic label placement. Technical Report TR-05-91, Advanced Research in Computing Technology. Harvard University

  • Narciso MG, Lorena LAN (1999) Lagrangean/surrogate relaxation for generalized assignment problems. Eur J Oper Res 114(1):165–177

    Article  Google Scholar 

  • Nascimento HAD, Eades P (2008) User hints for map labeling. J Vis Languages Comput 19(1):39–74

    Article  Google Scholar 

  • Padberg MW (1973) On the facial structure of set packing polyhedra. Math Program 5:199–215

    Article  Google Scholar 

  • Ribeiro GM, Lorena LAN (2006) Heuristics for cartographic label placement problems. Compu GeoSci 32(6):739–748

    Article  Google Scholar 

  • Ribeiro GM, Lorena LAN (2008a) Column generation approach for the point-feature cartographic label placement problem. J Comb Optim 15(2):147–164

    Article  Google Scholar 

  • Ribeiro GM, Lorena LAN (2008b) Lagrangean relaxation with clusters for point-feature cartographic label placement problems. Compu Oper Res 35(7):2129–2140

    Article  Google Scholar 

  • Sachdeva S (2004) Development of a branch and price approach involving vertex cloning to solve the maximum weighted independent set problem. Master Thesis, A&M University, College Station, Texas

  • Strijk T, Verweij B, Aardal K (2000) Algorithms for maximum independent set applied to map labeling. Technical Report UU-CS-2000-22, Universiteit Utrecht, Nederland

  • Taillard E, Voss S (2001) POPMUSIC: partial optimization metaheuristic under special intensification conditions. In: Ribeiro C, Hansen P (eds) Essays and survey in metaheuristics. Kluwer Academic Publishers, Boston, pp 613–629

    Google Scholar 

  • Verner OV, Wainwright RL, Schoenefeld DA (1997) Placing text labels on maps and diagrams using genetic algorithms with masking. J Compu 9(3):266–275

    Google Scholar 

  • Verweij B, Aardal K (1999) An optimisation algorithm for maximum independent set with applications in map labelling. In: Nesetril J (ed) Proceedings of the 7th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol 1643, pp 426–437

  • Wagner F, Wolff A (1998) A combinatorial framework for map labeling. In: Whitesides SH (ed) Proceedings of the 6th International Symposium on Graph Drawing, Lecture Notes in Computer Science, vol 1547, pp 316–331

  • Wagner F, Wolff A, Kapoor V, Strijk T (2001) Three rules suffice for good label placement. Algorithmica 30(2):334–349

    Article  Google Scholar 

  • Warrier D, Wilhelm WE, Warren JS, Hicks IV (2005) A branch-and-price approach for the maximum weight independent set problem. Networks 46(4):198–209

    Article  Google Scholar 

  • Wolff A (1999) Automated label placement in theory and practice. PhD Thesis, Fachbereich Mathematik und Informatik, Freie Universität Berlin

  • Wolff A, Strijk T (1996) The map-labeling bibliography. Available at http://www.i11.ira.uka.de/map-labeling/bibliography. Accessed 22 Dec 2008

  • Yamamoto M, Câmara G, Lorena LAN (2002) Tabu search heuristic for point-feature cartographic label placement. GeoInformatica 6(1):77–90

    Article  Google Scholar 

  • Yamamoto M, Lorena LAN (2005) A constructive genetic approach to point-feature cartographic label placement. In: Ibaraki T, Nonobe K, Yagiura M (eds) Metaheuristics: progress as real problem solvers. Springer, Berlin, pp 285–300

    Google Scholar 

  • Zoraster S (1990) The solution of large 0–1 integer programming problems encountered in automated cartography. Oper Res 38(5):752–759

    Article  Google Scholar 

Download references

Acknowledgments

The authors would like to thank the referees for their useful suggestions that have improved the quality of the paper, and FAPESP (process 04/11053-9) and CNPq (processes 305225/2006-5 and 471837/2008-3) for a partial financial support.

Author information

Authors and Affiliations

  1. Federal University of Espírito Santo-UFES, Espírito Santo, Brazil

    Glaydston M. Ribeiro & Geraldo R. Mauri

  2. National Institute for Space Research-INPE, São José dos Campos, Brazil

    Luiz Antonio N. Lorena

Authors
  1. Glaydston M. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Geraldo R. Mauri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luiz Antonio N. Lorena
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Glaydston M. Ribeiro.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ribeiro, G.M., Mauri, G.R. & Lorena, L.A.N. A lagrangean decomposition for the maximum independent set problem applied to map labeling. Oper Res Int J 11, 229–243 (2011). https://doi.org/10.1007/s12351-009-0075-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-009-0075-1

Keywords

Mathematics Subject Classification (2000)

Search

Navigation