On Minimum Stars and Maximum Matchings

Fekete, Sandor P. and Meijer, Henk (2000) On Minimum Stars and Maximum Matchings.
Published in: Discrete & computational geometry : an international journal of mathematics and computer science Vol. 23 (3). pp. 389-407.


Actions:
Download: [img] Postscript - Preprinted Version
Download (338kB) | Preview
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Article
Citations: 14 (Google Scholar) | 11 (Web of Science)
Uncontrolled Keywords: combinatorial optimization computational complexity connected network Euclidean norm extremal properties geometric inequalities geometric optimization Maximum matching rectilinear norm Weber problem
Subjects:
  • 51-XX Geometry > 51Mxx Real and complex geometry > 51M16 Inequalities and extremum problems

  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C27 Combinatorial optimization

    		•
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Schrader
    Mathematical Institute > Prof. Dr. Faigle
    Related URLs:
    Deposit Information:
    ZAIK Number: zaik1999-340a
    Depositing User: Archive Admin
    Date Deposited: 02 Apr 2001 00:00
    Last Modified: 19 Dec 2011 09:45
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/340001